Sciweavers

139 search results - page 12 / 28
» Improved Algorithms for the Global Cardinality Constraint
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 1 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
EWSN
2008
Springer
16 years 1 months ago
Efficient Clustering for Improving Network Performance in Wireless Sensor Networks
Clustering is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption and achieving better network performance. Mo...
Tal Anker, Danny Bickson, Danny Dolev, Bracha Hod
DAC
1989
ACM
15 years 5 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 6 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
CVPR
2005
IEEE
16 years 3 months ago
Combining Object and Feature Dynamics in Probabilistic Tracking
Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image fea...
Leonid Taycher, John W. Fisher III, Trevor Darrell