Sciweavers

1039 search results - page 183 / 208
» Query reformulation with constraints
Sort
View
CVPR
2007
IEEE
14 years 10 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
ICDE
1995
IEEE
99views Database» more  ICDE 1995»
14 years 9 months ago
Record Subtyping in Flexible Relations by Means of Attribute Dependencies
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...
Christian Kalus, Peter Dadam
EUROCRYPT
2009
Springer
14 years 9 months ago
Order-Preserving Symmetric Encryption
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
Alexandra Boldyreva, Nathan Chenette, Younho Lee, ...
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 9 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
POPL
2004
ACM
14 years 8 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen