Sciweavers

2543 search results - page 462 / 509
» Optimal Ordered Problem Solver
Sort
View
CIKM
2004
Springer
14 years 3 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
14 years 3 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
MATA
2001
Springer
177views Communications» more  MATA 2001»
14 years 2 months ago
A Self-adaptable Agent System for Efficient Information Gathering
As networks become all-pervasive the importance of efficient information gathering for purposes such as monitoring, fault diagnosis, and performance evaluation can only increase. E...
Antonio Liotta, George Pavlou, Graham Knight
EUROCOLT
1999
Springer
14 years 2 months ago
Regularized Principal Manifolds
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
COMPGEOM
1997
ACM
14 years 2 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...