Sciweavers

4850 search results - page 2 / 970
» Approximate Data Structures with Applications
Sort
View
MP
2010
162views more  MP 2010»
13 years 3 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
AMC
2006
77views more  AMC 2006»
13 years 5 months ago
A reduced three-dimensional dynamic structural model for structural health assessment
Dynamic models of elastic structures are derived using approximations of linear three dimensional elasticity. A model for the three dimensional motion of a nonsymmetric structure ...
Luther White
MICS
2010
137views more  MICS 2010»
13 years 3 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
14 years 5 days ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
OPODIS
2007
13 years 6 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...