Sciweavers

303 search results - page 61 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 8 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
COCOA
2009
Springer
13 years 9 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
COMPGEOM
2006
ACM
13 years 11 months ago
Locked and unlocked chains of planar shapes
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...