16430 search results - page 2537 / 3286 » On Computable Tree Functions |
185
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
205
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
271
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
The energy efficiency of computer systems is an important concern in a variety of contexts. In data centers, reducing energy use improves operating cost, scalability, reliability,...
317
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a real-time algorithm to estimate the 3D
pose of a previously unseen face from a single range im-
age. Based on a novel shape signature to identify noses in
range ima...
193
click to vote
ICFP
2001
ACM
16 years 7 months ago
2001
ACM
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...