Sciweavers

217 search results - page 3 / 44
» Uniform Generation in Spatial Constraint Databases and Appli...
Sort
View
CP
2006
Springer
13 years 11 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
DBPL
1999
Springer
122views Database» more  DBPL 1999»
13 years 11 months ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su
DEXA
2003
Springer
149views Database» more  DEXA 2003»
14 years 17 days ago
Capturing Uncertainty in Spatial Queries over Imprecise Data
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
Xingbo Yu, Sharad Mehrotra
CIVR
2005
Springer
134views Image Analysis» more  CIVR 2005»
14 years 27 days ago
Modeling Multi-object Spatial Relationships for Satellite Image Database Indexing and Retrieval
Abstract. Geospatial information analysts are interested in spatial configurations of objects in satellite imagery and, more importantly, the ability to search a large-scale datab...
Grant J. Scott, Matt Klaric, Chi-Ren Shyu
PODS
2000
ACM
102views Database» more  PODS 2000»
13 years 11 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers