Sciweavers

794 search results - page 122 / 159
» Improved algorithms for orienteering and related problems
Sort
View
IJACT
2008
158views more  IJACT 2008»
13 years 7 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 7 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
SIGIR
2003
ACM
14 years 28 days ago
ReCoM: reinforcement clustering of multi-type interrelated data objects
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
Jidong Wang, Hua-Jun Zeng, Zheng Chen, Hongjun Lu,...
CVPR
2006
IEEE
14 years 9 months ago
Incremental learning of object detectors using a visual shape alphabet
We address the problem of multiclass object detection. Our aims are to enable models for new categories to benefit from the detectors built previously for other categories, and fo...
Andreas Opelt, Axel Pinz, Andrew Zisserman
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
14 years 7 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan