Sciweavers

1809 search results - page 105 / 362
» Weakly Computable Real Numbers
Sort
View
CCA
2009
Springer
15 years 10 months ago
Relativizations of the P =? DNP Question for the BSS Model
We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x ≥ 0. The oracle machines can also check whethe...
Christine Gaßner
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
16 years 4 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
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, ...
Sean Hallgren
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 4 months ago
Recurrence relations and fast algorithms
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
Mark Tygert
CVPR
2005
IEEE
16 years 6 months ago
A New Active Contour Method Based on Elastic Interaction
Image segmentation is defined as partitioning an image into non-overlapping regions based on the intensity or texture. The active contour methods provide an effective way for segm...
Yang Xiang, Albert C. S. Chung, Jian Ye
ICCV
1998
IEEE
16 years 6 months ago
Visual Homing: Surfing on the Epipoles
We antroduce a novel method for vasual homang. Usang thas method a robot can be sent to desared posataons and oraentataons an 3-0space specafied by sangle amages taken from these ...
Ronen Basri, Ehud Rivlin, Ilan Shimshoni