Sciweavers

651 search results - page 6 / 131
» Index Sets and Universal Numberings
Sort
View
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 1 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
BMCBI
2005
152views more  BMCBI 2005»
14 years 9 months ago
Ranking the whole MEDLINE database according to a large training set using text indexing
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...
Brian P. Suomela, Miguel A. Andrade
FOCS
2008
IEEE
14 years 10 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
PDP
2008
IEEE
15 years 3 months ago
Distributed Sparse Spatial Selection Indexes
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
Veronica Gil Costa, Mauricio Marín
TKDE
1998
126views more  TKDE 1998»
14 years 9 months ago
Dictionary: A New Access Method for Query Processing in Object-Oriented Databases
—We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and asso...
Wang-Chien Lee, Dik Lun Lee