Sciweavers

4860 search results - page 125 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CVPR
2010
IEEE
14 years 4 days ago
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
Shengcai Liao, Guoying Zhao, Vili Kellokumpu, Matt...
COCOON
2009
Springer
14 years 4 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
JMLR
2010
118views more  JMLR 2010»
13 years 4 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
IPPS
2010
IEEE
13 years 8 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 5 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef