Sciweavers

1068 search results - page 149 / 214
» On Space Bounded Server Algorithms
Sort
View
PUK
2000
13 years 9 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
ACL
2011
12 years 11 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
ICCV
2007
IEEE
14 years 10 months ago
Globally Optimal Affine and Metric Upgrades in Stratified Autocalibration
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
ICCD
1997
IEEE
100views Hardware» more  ICCD 1997»
14 years 5 days ago
Optimal Clock Period Clustering for Sequential Circuits with Retiming
Abstract— In this paper we consider the problem of clustering sequential circuits subject to a bound on the area of each cluster, with the objective of minimizing the clock perio...
Arvind K. Karandikar, Peichen Pan, C. L. Liu