Sciweavers

4987 search results - page 410 / 998
» Support Ordered Resolution
Sort
View
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 8 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
JC
2007
63views more  JC 2007»
15 years 6 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
Stephan Dahlke, Erich Novak, Winfried Sickel
AMC
2004
108views more  AMC 2004»
15 years 6 months ago
A variational approach to magnetic resonance coil sensitivity estimation
Abstract. A variational method for estimating a magnetic resonance coil sensitivity from its corresponding nonuniform illumination of magnetic resonance images is proposed and anal...
Stephen L. Keeling, Roland Bammer
JSS
2010
120views more  JSS 2010»
15 years 5 months ago
An evaluation of timed scenario notations
There is a general consensus on the importance of good Requirements Engineering (RE) for achieving high quality software. The modeling and analysis of requirements have been the m...
Jameleddine Hassine, Juergen Rilling, Rachida Dsso...
RECOMB
2009
Springer
16 years 7 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....