Sciweavers

866 search results - page 131 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
CCR
2010
184views more  CCR 2010»
13 years 9 months ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
ICASSP
2008
IEEE
14 years 3 months ago
Optical flow robust estimation in a hybrid multi-resolution MRF framework
We propose in this paper a robust multi-resolution technique to estimate dense velocity field from image sequences. It couples a Gaussian pyramidal down-sampling decomposition to...
Cyril Cassisa, Véronique Prinet, Liang Shao...
ISMVL
2006
IEEE
109views Hardware» more  ISMVL 2006»
14 years 3 months ago
Towards Solving Many-Valued MaxSAT
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
PPSN
2004
Springer
14 years 2 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
DATE
1998
IEEE
82views Hardware» more  DATE 1998»
14 years 1 months ago
Exploiting Symbolic Techniques for Partial Scan Flip Flop Selection
Partial Scan techniques have been widely accepted as an effective solution to improve sequential ATPG performance while keeping acceptable area and performance overheads. Several ...
Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda,...