151 search results - page 21 / 31 » Computable Shell Decomposition Bounds |
161
click to vote
TCS
2011
14 years 10 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
122
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
115
click to vote
LPAR
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
161
click to vote
ISVC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
129
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...