Sciweavers

2883 search results - page 315 / 577
» Algorithms for merged indexes
Sort
View
ERCIMDL
1997
Springer
106views Education» more  ERCIMDL 1997»
14 years 1 months ago
Scalable Text Retrieval for Large Digital Libraries
It is argued that digital libraries of the future will contain terabyte-scale collections of digital text and that full-text searching techniques will be required to operate over c...
David Hawking
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
14 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...
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
14 years 1 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
DGO
2007
174views Education» more  DGO 2007»
13 years 11 months ago
A bootstrapping approach for identifying stakeholders in public-comment corpora
A stakeholder is an individual, group, organization, or community that has an interest or stake in a consensus-building process. The goal of stakeholder identification is identify...
Jaime Arguello, Jamie Callan
TREC
2004
13 years 11 months ago
York University at TREC 2004: HARD and Genomics Tracks
York University participated in HARD and Genomics tracks this year. For both tracks, we used Okapi BSS (basic search system) as the basis. Our experiments mainly focused on exploi...
Xiangji Huang, Yan Rui Huang, Ming Zhong, Miao Wen