Sciweavers

1688 search results - page 245 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CVIU
2007
158views more  CVIU 2007»
14 years 11 months ago
Local velocity-adapted motion events for spatio-temporal recognition
In this paper, we address the problem of motion recognition using event-based local motion representations. We assume that similar patterns of motion contain similar events with c...
Ivan Laptev, Barbara Caputo, Christian Schüld...
DAM
2007
107views more  DAM 2007»
14 years 11 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
14 years 11 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
BMCBI
2005
100views more  BMCBI 2005»
14 years 11 months ago
Speeding disease gene discovery by sequence based candidate prioritization
Background: Regions of interest identified through genetic linkage studies regularly exceed 30 centimorgans in size and can contain hundreds of genes. Traditionally this number is...
Euan A. Adie, Richard R. Adams, Kathryn L. Evans, ...
BMCBI
2005
126views more  BMCBI 2005»
14 years 11 months ago
HomoMINT: an inferred human network based on orthology mapping of protein interactions discovered in model organisms
Background: The application of high throughput approaches to the identification of protein interactions has offered for the first time a glimpse of the global interactome of some ...
Maria Persico, Arnaud Ceol, Caius Gavrila, Robert ...