Sciweavers

1801 search results - page 102 / 361
» Pointing without a pointer
Sort
View
MOC
2002
70views more  MOC 2002»
15 years 2 months ago
Positivity preserving finite element approximation
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
Ricardo H. Nochetto, Lars B. Wahlbin
JOLLI
2010
123views more  JOLLI 2010»
15 years 23 days ago
The Situation Calculus: A Case for Modal Logic
Abstract The situation calculus is one of the most established formalisms for reasoning about action and change. In this paper we will review the basics of Reiter’s version of th...
Gerhard Lakemeyer
168
Voted
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 7 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
ICCV
1999
IEEE
15 years 6 months ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...
GIS
2002
ACM
15 years 2 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...