493 search results - page 69 / 99 » The oracle penalty method |
162
click to vote
COOPIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract. We consider the use of a cluster system for Application Service Provider (ASP). In the ASP context, hosted applications and databases can be update-intensive and must rem...
214
click to vote
SSDBM
2002
IEEE
15 years 11 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
159
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
158
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
220
click to vote
DASFAA
2004
IEEE
15 years 9 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...