Sciweavers

137 search results - page 26 / 28
» Parameterized approximation of dominating set problems
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
EVOW
2006
Springer
13 years 11 months ago
A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
Matthieu Basseur, Eckart Zitzler
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
14 years 9 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik
FOCS
2007
IEEE
14 years 1 months ago
Mechanism Design via Differential Privacy
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
Frank McSherry, Kunal Talwar
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
14 years 1 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin