Sciweavers

973 search results - page 180 / 195
» New Bounds on Crossing Numbers
Sort
View
ICDM
2007
IEEE
183views Data Mining» more  ICDM 2007»
14 years 2 months ago
Depth-Based Novelty Detection and Its Application to Taxonomic Research
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
Yixin Chen, Henry L. Bart Jr., Xin Dang, Hanxiang ...
CCS
2007
ACM
14 years 2 months ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.
PODS
2010
ACM
242views Database» more  PODS 2010»
14 years 1 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 20 days ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 16 days ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian