Sciweavers

14158 search results - page 369 / 2832
» Generalized switch-setting problems
Sort
View
PODS
2003
ACM
142views Database» more  PODS 2003»
16 years 5 months ago
Query containment and rewriting using views for regular path queries under constraints
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Gösta Grahne, Alex Thomo
FOCS
2008
IEEE
15 years 11 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
IJCV
2002
140views more  IJCV 2002»
15 years 4 months ago
Orthonormal Vector Sets Regularization with PDE's and Applications
We are interested in regularizing fields of orthonormal vector sets, using constraint-preserving anisotropic diffusion PDE's. Each point of such a field is defined by multiple...
David Tschumperlé, Rachid Deriche
CONCURRENCY
1998
119views more  CONCURRENCY 1998»
15 years 4 months ago
C to Java: Converting Pointers into References
We consider the problem of converting C pointers to the less flexible concept of references. Our main application is converting scientific applications from C to Java. We provid...
Erik D. Demaine
SIAMDM
2010
123views more  SIAMDM 2010»
15 years 3 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...