Sciweavers

2880 search results - page 149 / 576
» Approximate Range Searching
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 4 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 4 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
226
Voted
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 3 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
141
Voted
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 1 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
VL
2006
IEEE
15 years 9 months ago
Sketching with Conceptual Metaphors to Explain Computational Processes
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
David G. Hendry