6110 search results - page 436 / 1222 » Approximate Computing |
146
click to vote
CCCG
2007
15 years 8 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
156
click to vote
ACL
2006
15 years 8 months ago
2006
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
186
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
192
click to vote
KAIS
2006
15 years 6 months ago
2006
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
149
click to vote
IJON
2007
15 years 6 months ago
2007
This paper presents a computational theory of developmental mental architectures for artificial and natural systems, motivated by neuroscience. The work is an attempt to approxim...