3092 search results - page 375 / 619 » Where are you pointing |
154
click to vote
ATVA
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. A distributed system is fault-tolerant if it continues to perform correctly even when a subset of the processes becomes faulty. Faulttolerance is highly desirable but oft...
142
click to vote
DAGM
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. Well known estimation techniques in computational geometry usually deal only with single geometric entities as unknown parameters and do not account for constrained obser...
158
click to vote
GECCO
2009
Springer
16 years 20 days ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
171
click to vote
ICVS
2009
Springer
16 years 20 days ago
2009
Springer
Traditionally computer vision and pattern recognition algorithms are evaluated by measuring differences between final interpretations and ground truth. These black-box evaluations ...
142
click to vote
ISSAC
2009
Springer
16 years 20 days ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...