Sciweavers

7840 search results - page 1381 / 1568
» On generalized Ramsey numbers
Sort
View
CIKM
2005
Springer
16 years 5 days ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
CIKM
2005
Springer
16 years 5 days ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
CLEF
2005
Springer
16 years 5 days ago
UNED at iCLEF 2005: Automatic Highlighting of Potential Answers
In this paper, we describe UNED’s participation in the iCLEF 2005 track. We have compared two strategies for finding an answer using an interactive question answering system: i...
Víctor Peinado, Fernando López-Osten...
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
16 years 5 days ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
COCOON
2005
Springer
16 years 5 days ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou
« Prev « First page 1381 / 1568 Last » Next »