Sciweavers

3656 search results - page 199 / 732
» Compact Location Problems
Sort
View
ICCAD
2003
IEEE
100views Hardware» more  ICCAD 2003»
16 years 3 months ago
A Theory of Non-Deterministic Networks
Both non-determinism and multi-level networks compactly characterize the flexibility allowed in implementing a circuit. A theory for representing and manipulating non-deterministi...
Alan Mishchenko, Robert K. Brayton
CVPR
2010
IEEE
16 years 2 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
ICDE
2010
IEEE
204views Database» more  ICDE 2010»
16 years 1 months ago
ProbClean: A probabilistic duplicate detection system
— One of the most prominent data quality problems is the existence of duplicate records. Current data cleaning systems usually produce one clean instance (repair) of the input da...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas...
BSN
2009
IEEE
136views Sensor Networks» more  BSN 2009»
16 years 1 months ago
Comparison of Orientation Filter Algorithms for Realtime Wireless Inertial Posture Tracking
—Advances in the miniaturisation of inertial sensors have allowed the design of compact wireless inertial orientation trackers. Such devices require data fusion algorithms to pro...
A. D. Young
CPAIOR
2009
Springer
16 years 25 days ago
Reformulating Global Grammar Constraints
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
George Katsirelos, Nina Narodytska, Toby Walsh