Sciweavers

866 search results - page 71 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
128
Voted
ICPR
2008
IEEE
16 years 4 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
119
Voted
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 7 months ago
Surrogate Parenthood: Protected and Informative Graphs
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
Barbara T. Blaustein, Adriane Chapman, Len Seligma...
143
Voted
FPL
2007
Springer
99views Hardware» more  FPL 2007»
15 years 7 months ago
Disjoint Pattern Enumeration for Custom Instructions Identification
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
Pan Yu, Tulika Mitra
109
Voted
SIROCCO
2007
15 years 5 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
151
Voted
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 4 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni