Sciweavers

270 search results - page 38 / 54
» Matching graphs of Hypercubes and Complete Bipartite Graphs
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
CSR
2009
Springer
14 years 3 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
CVIU
2008
192views more  CVIU 2008»
13 years 8 months ago
Content based video matching using spatiotemporal volumes
This paper presents a novel framework for matching video sequences using the spatiotemporal segmentation of videos. Instead of using appearance features for region correspondence ...
Arslan Basharat, Yun Zhai, Mubarak Shah
SAC
2006
ACM
13 years 8 months ago
Undue influence: eliminating the impact of link plagiarism on web search rankings
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...
Baoning Wu, Brian D. Davison
ICCV
2007
IEEE
14 years 2 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers