Sciweavers

921 search results - page 53 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
CIKM
2006
Springer
15 years 7 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
215
Voted
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 4 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
COMSIS
2010
15 years 1 months ago
MFI-tree: An effective multi-feature index structure for weighted query application
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
Yunfeng He, Junqing Yu
ECCV
2002
Springer
16 years 5 months ago
Probabilistic Search for Object Segmentation and Recognition
Abstract. The problem of searching for a model-based scene interpretation is analyzed within a probabilistic framework. Object models are formulated as generative models for range ...
Ulrich Hillenbrand, Gerd Hirzinger
DAMON
2009
Springer
15 years 10 months ago
A new look at the roles of spinning and blocking
Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to prot...
Ryan Johnson, Manos Athanassoulis, Radu Stoica, An...