6299 search results - page 157 / 1260 » Data and Computation Abstractions for Dynamic and Irregular ... |
173
Voted
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
215
click to vote
FOSSACS
2005
Springer
16 years 15 days ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
238
click to vote
TCS
2011
15 years 1 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...
213
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
195
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. With the rapid development of fast data acquisition techniques, 3D scans that record the geometric and photometric information of deformable objects are routinely acquire...