Sciweavers

2509 search results - page 217 / 502
» Abstract Geometrical Computation and Computable Analysis
Sort
View
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
15 years 8 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
SDM
2007
SIAM
201views Data Mining» more  SDM 2007»
15 years 8 months ago
Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis ...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
IJDMMM
2008
119views more  IJDMMM 2008»
15 years 6 months ago
A relational perspective on spatial data mining
: Remote sensing and mobile devices nowadays collect a huge amount of spatial data, which have to be analysed in order to discover interesting information about economic, social an...
Donato Malerba
IJDAR
2006
103views more  IJDAR 2006»
15 years 6 months ago
Table-processing paradigms: a research survey
Tables are a ubiquitous form of communication. While everyone seems to know what a table is, a precise, analytical definition of "tabularity" remains elusive because some...
David W. Embley, Matthew Hurst, Daniel P. Lopresti...