Sciweavers

1022 search results - page 88 / 205
» Logspace Complexity of Functions and Structures
Sort
View
BMCBI
2007
134views more  BMCBI 2007»
14 years 10 months ago
Automatic generation of 3D motifs for classification of protein binding sites
Background: Since many of the new protein structures delivered by high-throughput processes do not have any known function, there is a need for structure-based prediction of prote...
Jean-Christophe Nebel, Pawel Herzyk, David R. Gilb...
RT
1998
Springer
15 years 2 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
HICSS
2010
IEEE
210views Biometrics» more  HICSS 2010»
15 years 4 months ago
The Effects of Linguistic Features and Evaluation Perspective on Perceived Difficulty of Medical Text
Millions of laypersons need more medical information than they are customarily provided during their doctor’s visit. Health websites can help fill this knowledge gap, but the te...
Gondy Leroy, Stephen Helmreich, James R. Cowie
ICCV
2011
IEEE
13 years 10 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...