2766 search results - page 326 / 554 » Algorithms for trigonometric polynomials |
197
click to vote
FSTTCS
2004
Springer
16 years 14 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
200
click to vote
SSPR
2004
Springer
16 years 13 days ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
179
Voted
FOCS
2003
IEEE
16 years 12 days ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
169
click to vote
IPPS
2003
IEEE
16 years 11 days ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
214
click to vote
HYBRID
2003
Springer
16 years 9 days ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...