Výsledky vyhľadávania - "Nonnumerical Algorithms and Problems"
-
1
Mandatory Critical Points of 2D Uncertain Scalar Fields
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.06.2014Vydané v Computer graphics forum (01.06.2014)“…This paper introduces a novel, non‐local characterization of critical points and their global relation in 2D uncertain scalar fields. The characterization is…”
Získať plný text
Journal Article -
2
Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions
ISSN: 0167-7055, 1467-8659, 1467-8659Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.08.2013Vydané v Computer graphics forum (01.08.2013)“…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…”
Získať plný text
Journal Article -
3
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.08.2016Vydané v Computer graphics forum (01.08.2016)“…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…”
Získať plný text
Journal Article -
4
Radial contour labeling with straight leaders
ISSN: 2165-8773Vydavateľské údaje: IEEE 01.04.2017Vydané v IEEE Pacific Visualization Symposium (01.04.2017)“…The usefulness of technical drawings as well as scientific illustrations such as medical drawings of human anatomy essentially depends on the placement of…”
Získať plný text
Konferenčný príspevok.. -
5
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
ISSN: 0168-7433, 1573-0670, 1573-0670Vydavateľské údaje: Dordrecht Springer Netherlands 01.10.2019Vydané v Journal of automated reasoning (01.10.2019)“…Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF…”
Získať plný text
Journal Article -
6
New Bounds on the Size of Optimal Meshes
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.08.2012Vydané v Computer graphics forum (01.08.2012)“…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…”
Získať plný text
Journal Article -
7
Fleshing: Spine-driven Bending with Local Volume Preservation
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.05.2013Vydané v Computer graphics forum (01.05.2013)“…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…”
Získať plný text
Journal Article -
8
Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism
ISSN: 1545-5963, 1557-9964, 1557-9964Vydavateľské údaje: United States IEEE 01.01.2019Vydané v IEEE/ACM transactions on computational biology and bioinformatics (01.01.2019)“…The Burrows-Wheeler transform (BWT) of short-read data has unexplored potential utilities, such as for efficient and sensitive variation analysis against…”
Získať plný text
Journal Article -
9
Improved grid map layout by point set matching
ISSN: 2165-8765Vydavateľské údaje: IEEE 01.02.2013Vydané v 2013 IEEE Pacific Visualization Symposium (PacificVis) (01.02.2013)“…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…”
Získať plný text
Konferenčný príspevok.. -
10
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
ISSN: 0018-9340, 1557-9956Vydavateľské údaje: New York IEEE 01.06.2008Vydané v IEEE transactions on computers (01.06.2008)“…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…”
Získať plný text
Journal Article -
11
The complexity of verifying memory coherence and consistency
ISSN: 1045-9219, 1558-2183Vydavateľské údaje: New York IEEE 01.07.2005Vydané v IEEE transactions on parallel and distributed systems (01.07.2005)“…The problem of testing shared memories for memory coherence and consistency is studied. First, it is proved that detecting violations of coherence in an…”
Získať plný text
Journal Article -
12
Inclusion and Exclusion Criteria for Automating Adherence to Scope of Conference Calls for Papers
Vydavateľské údaje: IEEE 01.09.2022Vydané v 2022 Fourth International Conference on Transdisciplinary AI (TransAI) (01.09.2022)“…To conduct a well-designed and reproducible study, researchers must define and adhere to clear inclusion and exclusion criteria for subjects. Similarly, a…”
Získať plný text
Konferenčný príspevok.. -
13
TreeDT: tree pattern mining for gene mapping
ISSN: 1545-5963, 1557-9964Vydavateľské údaje: United States IEEE 01.04.2006Vydané v IEEE/ACM transactions on computational biology and bioinformatics (01.04.2006)“…We describe TreeDT, a novel association-based gene mapping method. Given a set of disease-associated haplotypes and a set of control haplotypes, TreeDT…”
Získať plný text
Journal Article -
14
Solving the traffic and flitter challenges with tulip
ISBN: 9781424452835, 142445283XVydavateľské údaje: IEEE 01.10.2009Vydané v 2009 IEEE Symposium on Visual Analytics Science and Technology (01.10.2009)“…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…”
Získať plný text
Konferenčný príspevok.. -
15
A method for improving full text search using signature files
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.2001Vydané v International journal of computer mathematics (01.01.2001)“…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…”
Získať plný text
Journal Article -
16
On the diagnosing algorithm for networks
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.2000Vydané v International journal of computer mathematics (01.01.2000)“…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…”
Získať plný text
Journal Article -
17
Approximate topological matching of quadrilateral meshes
ISBN: 9781424422609, 1424422604Vydavateľské údaje: IEEE 01.06.2008Vydané v 2008 IEEE International Conference on Shape Modeling and Applications (01.06.2008)“…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…”
Získať plný text
Konferenčný príspevok.. -
18
A link trie structure of storing multiple attribute relationships for natural language dictionaries
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1999Vydané v International Journal of Computer Mathematics (01.01.1999)“…Word relation is primitive knowledge and it is very useful for natural language processing systems. In the traditional systems, although each knowledge…”
Získať plný text
Journal Article -
19
Efficient multi-attribute pattern matching
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1998Vydané v International journal of computer mathematics (01.01.1998)“…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…”
Získať plný text
Journal Article -
20
A fast retrieval technique for large graph structures
ISSN: 0020-7160, 1029-0265Vydavateľské údaje: Abingdon Gordon and Breach Science Publishers 01.01.1996Vydané v International Journal of Computer Mathematics (01.01.1996)“…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…”
Získať plný text
Journal Article

