Sciweavers

21984 search results - page 4397 / 4397
» C
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...
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 8 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
11 years 8 months ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
PAMI
2010
168views more  PAMI 2010»
13 years 4 months ago
The Multiscenario Multienvironment BioSecure Multimodal Database (BMDB)
—A new multimodal biometric database designed and acquired within the framework of the European BioSecure Network of Excellence is presented. It is comprised of more than 600 ind...
Javier Ortega-Garcia, Julian Fiérrez, Ferna...
« Prev « First page 4397 / 4397 Last » Next »