Sciweavers

270 search results - page 17 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
MP
2002
84views more  MP 2002»
13 years 7 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
ADCM
2010
92views more  ADCM 2010»
13 years 7 months ago
Construction of infinite unimodular sequences with zero autocorrelation
Unimodular waveforms x are constructed on the integers with the property that the autocorrelation of x is one at the origin and zero elsewhere. There are three different constructi...
John J. Benedetto, Somantika Datta
ICDE
2008
IEEE
155views Database» more  ICDE 2008»
14 years 9 months ago
Lattice Histograms: a Resilient Synopsis Structure
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
Panagiotis Karras, Nikos Mamoulis
PERCOM
2006
ACM
14 years 7 months ago
Unearthing Design Patterns to Support Context-Awareness
The lack of structured methodologies and software engineering efforts on designing the support of contextawareness in pervasive systems hinders the potential advantages of analyzi...
Oriana Riva, Cristiano di Flora, Stefano Russo, Ki...
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...