Sciweavers

699 search results - page 28 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
GEOINFO
2003
14 years 11 months ago
Modelling Spatial Relations by Generalized Proximity Matrices
One of the main challenges for the development of spatial information theory is the formalization of the concepts of space and spatial relations. Currently, most spatial data struc...
Ana Paula Dutra de Aguiar, Gilberto Câmara, ...
CVPR
2010
IEEE
15 years 5 months ago
A Theory of Plenoptic Multiplexing
Multiplexing is a common technique for encoding highdimensional image data into a single, two-dimensional image. Examples of spatial multiplexing include Bayer patterns to capture...
Ivo Ihrke, Gordon Wetzstein, Wolfgang Heidrich
75
Voted
CVPR
2010
IEEE
15 years 6 months ago
An Approach to Vectorial Total Variation based on Geometric Measure Theory
We analyze a previously unexplored generalization of the scalar total variation to vector-valued functions, which is motivated by geometric measure theory. A complete mathematical...
Bastian Goldluecke, Daniel Cremers
SPAA
2005
ACM
15 years 3 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi