Sciweavers

514 search results - page 38 / 103
» Foundations of Aggregation Constraints
Sort
View
FOCM
2010
97views more  FOCM 2010»
13 years 6 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 2 months ago
Region Sampling: Continuous Adaptive Sampling on Sensor Networks
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
Song Lin, Benjamin Arai, Dimitrios Gunopulos, Gaut...
DAGSTUHL
2006
13 years 9 months ago
On Scene Interpretation with Description Logics
We examine the possible use of Description Logics as a knowledge representation and reasoning system for high-level scene interpretation. It is shown that aggregates composed of m...
Bernd Neumann, Ralf Möller
ACTA
2002
111views more  ACTA 2002»
13 years 8 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
GIS
2006
ACM
14 years 9 months ago
Generalization of land cover maps by mixed integer programming
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
Jan-Henrik Haunert, Alexander Wolff