Sciweavers

1688 search results - page 115 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CGF
2004
86views more  CGF 2004»
15 years 5 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek
TITB
2010
167views Education» more  TITB 2010»
15 years 14 days ago
Structural action recognition in body sensor networks: distributed classification based on string matching
Mobile sensor-based systems are emerging as promising platforms for healthcare monitoring. An important goal of these systems is to extract physiological information about the subj...
Hassan Ghasemzadeh, Vitali Loseu, Roozbeh Jafari
COCOON
2005
Springer
15 years 11 months ago
Conserved Interval Distance Computation Between Non-trivial Genomes
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene...
Guillaume Blin, Romeo Rizzi
BMCBI
2010
150views more  BMCBI 2010»
15 years 5 months ago
MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure
Background: The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of th...
Sriganesh Srihari, Kang Ning, Hon Wai Leong
ECCC
2008
168views more  ECCC 2008»
15 years 5 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson