Sciweavers

422 search results - page 58 / 85
» Generalizations of small profinite structures
Sort
View
CIKM
2004
Springer
14 years 1 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
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 1 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
CASES
2003
ACM
14 years 1 months ago
Frequent loop detection using efficient non-intrusive on-chip hardware
Dynamic software optimization methods are becoming increasingly popular for improving software performance and power. The first step in dynamic optimization consists of detecting ...
Ann Gordon-Ross, Frank Vahid
ISLPED
2003
ACM
90views Hardware» more  ISLPED 2003»
14 years 1 months ago
Low cost instruction cache designs for tag comparison elimination
Tag comparison elimination (TCE) is an effective approach to reduce I-cache energy. Current research focuses on finding good tradeoffs between hardware cost and percentage of comp...
Youtao Zhang, Jun Yang 0002
ICAIL
2009
ACM
14 years 1 months ago
The network of French legal codes
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
Pierre Mazzega, Danièle Bourcier, Romain Bo...