Sciweavers

3838 search results - page 525 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
ICALP
2003
Springer
15 years 9 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf
SSIAI
2002
IEEE
15 years 8 months ago
Volumetric Segmentation via 3D Active Shape Models
A volumetric image segmentation algorithm has been developed and implemented by extending a 2D algorithm based on Active Shape Models. The new technique allows segmentation of 3D ...
Molly M. Dickens, Shaun S. Gleason, Hamed Sari-Sar...
ICALP
2010
Springer
15 years 8 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
VISUALIZATION
1998
IEEE
15 years 8 months ago
Isosurface extraction in time-varying fields using a temporal hierarchical index tree
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...
Han-Wei Shen
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 8 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan