Sciweavers

5105 search results - page 401 / 1021
» Approximate Structural Consistency
Sort
View
SIGGRAPH
2010
ACM
15 years 11 months ago
Star-contours for efficient hierarchical self-collision detection
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
Sara C. Schvartzman, Álvaro G. Pérez, Miguel A. ...
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 10 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
EDBT
2000
ACM
15 years 10 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
CIKM
2008
Springer
15 years 8 months ago
Mapping enterprise entities to text segments
Today, valuable business information is increasingly stored as unstructured data (documents, emails, etc.). For example, documents exchanged between business partners capture info...
Falk Brauer, Alexander Löser, Hong-Hai Do
UAI
2003
15 years 8 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...