Sciweavers

200 search results - page 35 / 40
» Datalog Queries of Set Constraint Databases
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
AAI
2007
132views more  AAI 2007»
13 years 7 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 7 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
ECIR
2011
Springer
12 years 11 months ago
Video Retrieval Based on Words-of-Interest Selection
Query-by-example video retrieval is receiving an increasing attention in recent years. One of the state-of-art approaches is the Bag-of-visual Words (BoW) based technique, where im...
Lei Wang, Dawei Song, Eyad Elyan
GIS
2008
ACM
14 years 8 months ago
Should SDBMS support a join index?: a case study from CrimeStat
Given a spatial crime data warehouse, that is updated infrequently and a set of operations O as well as constraints of storage and update overheads, the index type selection probl...
Pradeep Mohan, Ronald E. Wilson, Shashi Shekhar, B...