Sciweavers

2223 search results - page 431 / 445
» Query Optimization in an OODBMS
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 10 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
ALT
2006
Springer
14 years 6 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
CVPR
2009
IEEE
14 years 4 months ago
Contextual decomposition of multi-label images
Most research on image decomposition, e.g. image segmentation and image parsing, has predominantly focused on the low-level visual clues within single image and neglected the cont...
Teng Li, Tao Mei, Shuicheng Yan, In-So Kweon, Chil...
DASFAA
2009
IEEE
191views Database» more  DASFAA 2009»
14 years 4 months ago
Benchmarking Performance-Critical Components in a Native XML Database System
The rapidly increasing number of XML-related applications indicates a growing need for efficient, dynamic, and native XML support in database management systems (XDBMS). So far, bo...
Karsten Schmidt 0002, Sebastian Bächle, Theo ...