Sciweavers

4860 search results - page 778 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
14 years 9 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
CVPR
2000
IEEE
16 years 8 months ago
Fluid Structure and Motion Analysis from Multi-spectrum 2D Cloud Image Sequences
In this paper we present a novel approach to estimate and analyze 3D uid structure and motion of clouds from multi-spectrum 2D cloud image sequences. Accurate cloud-top structure ...
Lin Zhou, Chandra Kambhamettu, Dmitry B. Goldgof
CVPR
2008
IEEE
16 years 8 months ago
Discovering class specific composite features through discriminative sampling with Swendsen-Wang Cut
This paper proposes a novel approach to discover a set of class specific "composite features" as the feature pool for the detection and classification of complex objects...
Feng Han, Ying Shan, Harpreet S. Sawhney, Rakesh K...