Sciweavers

2252 search results - page 133 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
107
Voted
ENTCS
2006
112views more  ENTCS 2006»
15 years 3 months ago
Distributed Symbolic Bounded Property Checking
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
Pradeep Kumar Nalla, Roland J. Weiss, Prakash Moha...
CP
2005
Springer
15 years 9 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ICIAP
2007
ACM
16 years 3 months ago
Efficient and optimal block matching for motion estimation
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
132
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
SIAMCOMP
1998
162views more  SIAMCOMP 1998»
15 years 3 months ago
Hypercubic Sorting Networks
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
Frank Thomson Leighton, C. Greg Plaxton