Sciweavers

1431 search results - page 166 / 287
» The complexity of random ordered structures
Sort
View
CHI
2006
ACM
16 years 3 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
147
Voted
BMCBI
2007
134views more  BMCBI 2007»
15 years 3 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...
CVPR
2004
IEEE
16 years 5 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 4 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
107
Voted
ICML
2009
IEEE
16 years 4 months ago
Curriculum learning
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
Jérôme Louradour, Jason Weston, Ronan...