Sciweavers

2100 search results - page 335 / 420
» Fundamentals of the problem
Sort
View
AI
2008
Springer
13 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 21 days ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 8 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
CVPR
2006
IEEE
14 years 11 months ago
3D Surface Matching and Recognition Using Conformal Geometry
3D surface matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition and classification. However, surface matchin...
Sen Wang, Yang Wang, Miao Jin, Xianfeng Gu, Dimitr...
ICCV
2007
IEEE
14 years 11 months ago
Supervised Learning of Image Restoration with Convolutional Networks
Convolutional networks have achieved a great deal of success in high-level vision problems such as object recognition. Here we show that they can also be used as a general method ...
Viren Jain, Joseph F. Murray, Fabian Roth, Sriniva...