Sciweavers

599 search results - page 42 / 120
» The repeater tree construction problem
Sort
View
IJFCS
2008
110views more  IJFCS 2008»
14 years 9 months ago
Indexing Gapped-Factors Using a Tree
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
INFORMS
2006
87views more  INFORMS 2006»
14 years 9 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
DAM
1999
169views more  DAM 1999»
14 years 9 months ago
Approximating the Weight of Shallow Steiner Trees
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
Guy Kortsarz, David Peleg
IPSN
2009
Springer
15 years 4 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
CGA
2007
14 years 9 months ago
Optical Splitting Trees for High-Precision Monocular Imaging
The authors address the problem of designing and constructing efficient cameras that can simultaneously capture multiple pixel-aligned images for computational photography applic...
Morgan McGuire, Wojciech Matusik, Hanspeter Pfiste...