Sciweavers

2069 search results - page 179 / 414
» Linear time algorithms for Clobber
Sort
View
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 6 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
COMPGEOM
1991
ACM
15 years 8 months ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
David Avis, Komei Fukuda
JPDC
2007
112views more  JPDC 2007»
15 years 4 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
16 years 1 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
CVPR
2010
IEEE
16 years 25 days ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang