Sciweavers

5499 search results - page 1008 / 1100
» Generalized Rewrite Theories
Sort
View
CIKM
2005
Springer
14 years 4 months ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
CIKM
2005
Springer
14 years 4 months 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
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 4 months 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
EMSOFT
2005
Springer
14 years 4 months ago
Real-time interfaces for interface-based design of real-time systems with fixed priority scheduling
The central idea behind interface-based design is to describe components by a component interface. In contrast to a component description that describes what a component does, a c...
Ernesto Wandeler, Lothar Thiele
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
14 years 4 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
« Prev « First page 1008 / 1100 Last » Next »