Sciweavers

3897 search results - page 46 / 780
» complexity 2010
Sort
View
DCG
2010
132views more  DCG 2010»
13 years 7 months ago
Delaunay Refinement for Piecewise Smooth Complexes
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...
TEC
2010
184views more  TEC 2010»
13 years 2 months ago
Automatic Reproduction of a Genius Algorithm: Strassen's Algorithm Revisited by Genetic Search
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
Seunghyun Oh, Byung-Ro Moon
IRCDL
2010
13 years 9 months ago
Interactive Visual Representations of Complex Information Structures
One of the most challenging issues in managing the large and diverse data available on the World Wide Web is the design of interactive systems to organize and represent information...
Gianpaolo D'Amico, Alberto Del Bimbo, Marco Meoni
LATINCRYPT
2010
13 years 6 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...