Sciweavers

731 search results - page 89 / 147
» Reductions to Graph Isomorphism
Sort
View
ICPR
2008
IEEE
14 years 10 months ago
Segmentation by combining parametric optical flow with a color model
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
Adrian Ulges, Thomas M. Breuel
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
12 years 8 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
CRV
2007
IEEE
231views Robotics» more  CRV 2007»
14 years 3 months ago
Establishing Visual Correspondence from Multi-Resolution Graph Cuts for Stereo-Motion
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
Joshua Worby, W. James MacLean
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 8 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 2 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han