2200 search results - page 241 / 440 » Bloch's Constant is Computable |
179
click to vote
ECCV
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we develop a systematic theory about local structure of moving images in terms of Galilean differential invariants. We argue that Galilean invariants are useful for s...
176
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
184
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
179
click to vote
CVPR
2000
IEEE
15 years 10 months ago
2000
IEEE
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse o...
188
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...