3353 search results - page 340 / 671 » Laver and set theory |
172
click to vote
ICDT
2005
ACM
16 years 8 days ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
161
Voted
OTM
2005
Springer
16 years 7 days ago
2005
Springer
Several applications require reasoning over autonomously developed ontologies. Initially conceived to explicit the semantics of a certain domain, these ontologies become a powerfu...
155
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
168
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
178
click to vote
SIGECOM
2004
ACM
16 years 5 days ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...