580 search results - page 31 / 116 » Approximation Algorithms for Temporal Reasoning |
132
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
111
click to vote
CAD
2008
Springer
15 years 2 months ago
2008
Springer
Curves on surfaces play an important role in computer-aided geometric design. Because of the considerably high degree of exact curves on surfaces, approximation algorithms are pre...
104
Voted
NIPS
2007
15 years 3 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
105
click to vote
SMI
2003
IEEE
15 years 7 months ago
2003
IEEE
Reverse engineering allows the geometric reconstruction of simple mechanical parts. However, the resulting models suffer from inaccuracies caused by errors in measurement and reco...
119
click to vote
ESANN
2006
15 years 3 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...