Sciweavers

331 search results - page 32 / 67
» The Plaited Structure of Time in Information Technology
Sort
View
CIKM
2004
Springer
14 years 4 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
SIGIR
2000
ACM
14 years 3 months ago
Hill climbing algorithms for content-based retrieval of similar configurations
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
Dimitris Papadias
CIKM
2011
Springer
12 years 10 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
WWW
2004
ACM
14 years 11 months ago
Efficient web change monitoring with page digest
The Internet and the World Wide Web have enabled a publishing explosion of useful online information, which has produced the unfortunate side effect of information overload: it is...
David Buttler, Daniel Rocco, Ling Liu
SIGUCCS
2000
ACM
14 years 3 months ago
Three Years in the Solution Center
After thirty-plus years of making small “mid-course corrections” types of changes to the support paradigm, many on the Iowa State University campus thought it was time to make...
Frank Poduska