Sciweavers

565 search results - page 65 / 113
» Colorization by Matrix Completion
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
DAM
2010
167views more  DAM 2010»
13 years 8 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
BMCBI
2008
128views more  BMCBI 2008»
13 years 8 months ago
An efficient visualization tool for the analysis of protein mutation matrices
Background: It is useful to develop a tool that would effectively describe protein mutation matrices specifically geared towards the identification of mutations that produce eithe...
Maria Pamela C. David, Carlo M. Lapid, Vincent Ric...
ECCV
2000
Springer
14 years 10 months ago
Non-parametric Model for Background Subtraction
Abstract. Background subtraction is a method typically used to segment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the sc...
Ahmed M. Elgammal, David Harwood, Larry S. Davis
CHI
2005
ACM
14 years 9 months ago
Stencils-based tutorials: design and evaluation
Users of traditional tutorials and help systems often have difficulty finding the components described or pictured in the procedural instructions. Users also unintentionally miss ...
Caitlin Kelleher, Randy Pausch