Sciweavers

634 search results - page 45 / 127
» Fast Evaluation Techniques for Complex Similarity Queries
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 12 days ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
ICUMT
2009
13 years 5 months ago
Application of smoothed estimators in spectrum sensing technique based on model selection
In cognitive radio networks, secondary user (SU) does not have rights to transmit when the primary user (PU) band is occupied, that's why a sensing technique must be done. Rec...
Bassem Zayen, Aawatif Hayar, Hamza Debbabi, Hichem...
CVPR
2010
IEEE
13 years 10 months ago
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
Shengcai Liao, Guoying Zhao, Vili Kellokumpu, Matt...
ILP
2003
Springer
14 years 1 months ago
Query Optimization in Inductive Logic Programming by Reordering Literals
Query optimization is used frequently in relational database management systems. Most existing techniques are based on reordering the relational operators, where the most selective...
Jan Struyf, Hendrik Blockeel