Sciweavers

397 search results - page 46 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
MP
2007
95views more  MP 2007»
13 years 7 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
ICSOC
2004
Springer
14 years 1 months ago
Toward autonomic web services trust and selection
Emerging Web services standards enable the development of large-scale applications in open environments. In particular, they enable services to be dynamically bound. However, curr...
E. Michael Maximilien, Munindar P. Singh
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
CISS
2008
IEEE
14 years 2 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
11 years 10 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...