Sciweavers

20441 search results - page 441 / 4089
» Locally Computable Structures
Sort
View
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
14 years 6 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
SC
2009
ACM
16 years 1 months ago
Scalable computing with parallel tasks
Recent and future parallel clusters and supercomputers use SMPs and multi-core processors as basic nodes, providing a huge amount of parallel resources. These systems often have h...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
COMPGEOM
2004
ACM
16 years 5 days ago
A computational framework for incremental motion
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...
David M. Mount, Nathan S. Netanyahu, Christine D. ...
153
Voted
NA
2008
80views more  NA 2008»
15 years 6 months ago
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
Yuli Eidelman, Luca Gemignani, Israel Gohberg
CAD
2004
Springer
15 years 6 months ago
Computer modeling approach for microsphere-packed bone scaffold
A computer modeling approach for constructing a three-dimensional microsphere-packed bone graft structure is presented. The modeling approach consists of both geometric and CAD-ba...
Pallavi Lal, Wei Sun