Search Results - "nonnumerical algorithms and problems"

Mandatory Critical Points of 2D Uncertain Scalar Fields by Günther, David, Salmon, Joseph, Tierny, Julien

“…This paper introduces a novel, non‐local characterization of critical points and their global relation in 2D uncertain scalar fields. The characterization is…”
Get full text

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions by Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This…”
Get full text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams by Bennett, H., Papadopoulou, E., Yap, C.

“…Let X = {f1, …, fn} be a set of scalar functions of the form fi : ℝ2 → ℝ which satisfy some natural properties. We describe a subdivision algorithm for…”
Get full text

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF by Beyersdorff, Olaf, Blinkhorn, Joshua, Chew, Leroy, Schmidt, Renate, Suda, Martin

“…Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF…”
Get full text

Radial contour labeling with straight leaders by Niedermann, Benjamin, Nollenburg, Martin, Rutter, Ignaz

“…The usefulness of technical drawings as well as scientific illustrations such as medical drawings of human anatomy essentially depends on the placement of…”
Get full text

New Bounds on the Size of Optimal Meshes by Sheehy, Donald R.

“…The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of…”
Get full text

Fleshing: Spine-driven Bending with Local Volume Preservation by Zhuo, Wei, Rossignac, Jarek

“…Several design and animation techniques use a one‐dimensional proxy C (a spine curve in 3D) to control the deformation or behavior of a digital model of a 3D…”
Get full text

Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism by Kimura, Kouichi, Koike, Asako

“…The Burrows-Wheeler transform (BWT) of short-read data has unexplored potential utilities, such as for efficient and sensitive variation analysis against…”
Get full text

Improved grid map layout by point set matching by Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“…Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered…”
Get full text

Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure by Liu, Bing-Hong, Ke, Wei-Chieh, Tsai, Chin-Hsien, Tsai, Ming-Jer

“…Wireless sensor networks have often been used to monitor and report the locations of moving objects. Since sensors can also be used for storage, a wireless…”
Get full text

The complexity of verifying memory coherence and consistency by Cantin, J.F., Lipasti, M.H., Smith, J.E.

“…The problem of testing shared memories for memory coherence and consistency is studied. First, it is proved that detecting violations of coherence in an…”
Get full text

Inclusion and Exclusion Criteria for Automating Adherence to Scope of Conference Calls for Papers by Craig, Adam, Taswell, Carl

“…To conduct a well-designed and reproducible study, researchers must define and adhere to clear inclusion and exclusion criteria for subjects. Similarly, a…”
Get full text

TreeDT: tree pattern mining for gene mapping by Sevon, P., Toivonen, H., Ollikainen, V.

“…We describe TreeDT, a novel association-based gene mapping method. Given a set of disease-associated haplotypes and a set of control haplotypes, TreeDT…”
Get full text

Solving the traffic and flitter challenges with tulip by Simonetto, P., Koenig, P.-Y., Zaidi, F., Archambault, D., Gilbert, F., Trung-Tien Phan-Quang, Mathiaut, M., Lambert, A., Dubois, J., Sicre, R., Brulin, M., Vieux, R., Melancon, G.

“…We present our visualization systems and findings for the badge and network traffic as well as the social network and geospatial challenges of the 2009 VAST…”
Get full text

A method for improving full text search using signature files by Yamakawa, Yoshihiro, Fuketa, Masao, Morita, Kazuhiro, Aoe, Jun-ichi

“…Efficiency of full text retrieval using signatures depends on the number of filtering and the reduction of the original text, but there has been no discussion…”
Get full text

On the diagnosing algorithm for networks by Biasizzo, Anton, Novak, Franc

“…An example is given for which the diagnosing algorithm for networks, proposed by T. Kameda, S. Toida and F. J. Allan, fails to compute the correct system…”
Get full text

Approximate topological matching of quadrilateral meshes by Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.

“…We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two…”
Get full text

A link trie structure of storing multiple attribute relationships for natural language dictionaries by Morita, Kazuhiro, Koyama, Masafumi, Fuketa, Masao, Aoe, Jun-Ichi

“…Word relation is primitive knowledge and it is very useful for natural language processing systems. In the traditional systems, although each knowledge…”
Get full text

Efficient multi-attribute pattern matching by Ando, Kazuaki, Mizobuchi, Shoji, Shishibori, Masami, Aoe, Jun-Ichi

“…This paper describes an efficient multi-attribute pattern matching machine to locate all occurrences of any of a finite number of a sequence of rule structures…”
Get full text

A fast retrieval technique for large graph structures by Iriguchi, Hirokazu, Koyama, Masashi, Shishibori, Masami, Aoe, Jun-Ichi

“…Graphs are a typical and basic data structure for computer algorithms. A two-dimensional array and a list are well-known as for their representation. These…”
Get full text