Sciweavers

1933 search results - page 218 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
SIGIR
1997
ACM
15 years 8 months ago
Learning Routing Queries in a Query Zone
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
Amit Singhal, Mandar Mitra, Chris Buckley
ECRTS
1998
IEEE
15 years 8 months ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 10 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
ICPR
2008
IEEE
15 years 11 months ago
Transductive optimal component analysis
We propose a new transductive learning algorithm for learning optimal linear representations that utilizes unlabeled data. We pose the problem of learning linear representations a...
Yuhua Zhu, Yiming Wu, Xiuwen Liu, Washington Mio
ICMLA
2008
15 years 5 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad