Sciweavers

102291 search results - page 213 / 20459
» Computability in Computational Geometry
Sort
View
GRAPHITE
2003
ACM
15 years 11 months ago
Boundary treatment for virtual leaf surfaces
When working on fitting leaf surfaces for use with virtual plant models [Room et al. 1996] we encountered the unsatisfactory situation of receiving a smooth surface model that is...
Birgit I. Loch, John Belward, Jim Hanan
DSN
2004
IEEE
15 years 10 months ago
Fault Tolerant Computation on Ensemble Quantum Computers
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual com...
P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, F...
AMC
2007
108views more  AMC 2007»
15 years 6 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
MCU
2004
141views Hardware» more  MCU 2004»
15 years 8 months ago
Abstract Geometrical Computation for Black Hole Computation
geometrical computation for Black hole computation d abstract) J
Jérôme Durand-Lose
« Prev « First page 213 / 20459 Last » Next »