Sciweavers

1007 search results - page 88 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
15 years 9 months ago
Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
Ruoming Jin, Gagan Agrawal
ICIP
2001
IEEE
16 years 4 months ago
A recursive optimal relevance feedback scheme for content based image retrieval
In this paper, an optimal relevance algorithm is proposed, which adapts the response of a content-based image retrieval (CBIR) system to the user's information needs. In part...
Anastasios D. Doulamis, Nikolaos D. Doulamis
DLOG
2010
15 years 28 days ago
TBox Classification in Parallel: Design and First Evaluation
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 8 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 6 months ago
Characterizing large text corpora using a maximum variation sampling genetic algorithm
An enormous amount of information available via the Internet exists. Much of this data is in the form of text-based documents. These documents cover a variety of topics that are v...
Robert M. Patton, Thomas E. Potok