Sciweavers

1382 search results - page 179 / 277
» Term ordering problem on MDG
Sort
View
97
Voted
CIKM
2004
Springer
15 years 6 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
ICMI
2004
Springer
95views Biometrics» more  ICMI 2004»
15 years 6 months ago
EyePrint: support of document browsing with eye gaze trace
Current digital documents provide few traces to help user browsing. This makes document browsing difficult, and we sometimes feel it is hard to keep track of all of the informati...
Takehiko Ohno
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
15 years 6 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
112
Voted
MMB
2004
Springer
175views Communications» more  MMB 2004»
15 years 6 months ago
Sensitivity Analysis for MAP/MAP/1 Queues
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correlated service times is performed. We study and compare the isolated impact of (...
Armin Heindl
120
Voted
GLVLSI
2003
IEEE
129views VLSI» more  GLVLSI 2003»
15 years 6 months ago
A system-level methodology for fast multi-objective design space exploration
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized systems. Since the design space is multi-objective, our aim ...
Gianluca Palermo, Cristina Silvano, S. Valsecchi, ...