Sciweavers

736 search results - page 104 / 148
» A dynamic data structure for approximate range searching
Sort
View
ISBI
2008
IEEE
14 years 9 months ago
An algorithm to map asymmetries of bilateral objects in point clouds
We present a method to automatically quantify the local asymmetries of bilateral structures in point clouds. The method relies on the robust computation of the approximate symmetr...
Benoît Combès, Robin Hennessy, John W...
IPPS
2006
IEEE
14 years 2 months ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
EDBT
2009
ACM
166views Database» more  EDBT 2009»
14 years 1 months ago
Neighbor-based pattern detection for windows over streaming data
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 10 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 9 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani