Sciweavers

274 search results - page 36 / 55
» Computational complexity of queries based on itemsets
Sort
View
COLCOM
2007
IEEE
15 years 5 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen
PEPM
2010
ACM
16 years 18 days ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
KAIS
2006
110views more  KAIS 2006»
15 years 3 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
CIVR
2009
Springer
192views Image Analysis» more  CIVR 2009»
15 years 10 months ago
Example based video filters
Many of the successful multimedia retrieval systems focus on developing efficient and effective video retrieval solutions with the help of appropriate index structures. In these ...
Mihir Jain, Sreekanth Vempati, Chandrika Pulla, C....
159
Voted
W2GIS
2004
Springer
15 years 9 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou