Sciweavers

471 search results - page 40 / 95
» Computational complexity: a conceptual perspective
Sort
View
BMCBI
2007
145views more  BMCBI 2007»
13 years 8 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 8 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
SMI
2005
IEEE
14 years 2 months ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
ECCV
2000
Springer
14 years 10 months ago
Stochastic Tracking of 3D Human Figures Using 2D Image Motion
A probabilistic method for tracking 3D articulated human figures in monocular image sequences is presented. Within a Bayesian framework, we define a generative model of image appea...
Hedvig Sidenbladh, Michael J. Black, David J. Flee...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 1 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler