Sciweavers

945 search results - page 130 / 189
» On the robustness of primitive words
Sort
View
COMPGEOM
2003
ACM
15 years 11 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
EDBT
2010
ACM
189views Database» more  EDBT 2010»
15 years 11 months ago
Efficient physical operators for cost-based XPath execution
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
FOCS
2002
IEEE
15 years 11 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
SSIAI
2002
IEEE
15 years 11 months ago
Active Contours for Cell Tracking
This paper introduces an active contour or snakebased method for tracking cells within a video sequence. Specifically, we apply our cell tracking techniques to rolling leukocytes ...
Nilanjan Ray, Scott T. Acton
IOLTS
2000
IEEE
105views Hardware» more  IOLTS 2000»
15 years 10 months ago
Comparison between Random and Pseudo-Random Generation for BIST of Delay, Stuck-at and Bridging Faults
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
Patrick Girard, Christian Landrault, Serge Pravoss...