Sciweavers

3656 search results - page 174 / 732
» Compact Location Problems
Sort
View
BC
2006
132views more  BC 2006»
15 years 5 months ago
Local visual homing by matched-filter descent in image distances
Abstract In natural images, the distance measure between two images taken at different locations rises smoothly with increasing distance between the locations. This fact can be exp...
Ralf Möller, Andrew Vardy
111
Voted
WG
2000
Springer
15 years 8 months ago
Budget Constrained Minimum Cost Connected Medians
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
Goran Konjevod, Sven Oliver Krumke, Madhav V. Mara...
STACS
1987
Springer
15 years 8 months ago
Graph Isomorphism is in the Low Hierarchy
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...
Uwe Schöning
VLDB
2001
ACM
86views Database» more  VLDB 2001»
15 years 9 months ago
Intelligent Rollups in Multidimensional OLAP Data
In this paper we propose a new operator for advanced exploration of large multidimensional databases. The proposed operator can automatically generalize from a specific problem c...
Gayatri Sathe, Sunita Sarawagi
240
Voted
ICCV
2009
IEEE
16 years 10 months ago
Filter Flow
The filter flow problem is to compute a space-variant linear filter that transforms one image into another. This framework encompasses a broad range of transformations including...
Steven M. Seitz, Simon Baker