Sciweavers

5084 search results - page 1013 / 1017
» Proving Possibility Properties
Sort
View
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 4 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
TITB
2010
123views Education» more  TITB 2010»
13 years 4 months ago
The pseudotemporal bootstrap for predicting glaucoma from cross-sectional visual field data
Progressive loss of the field of vision is characteristic of a number of eye diseases such as glaucoma, a leading cause of irreversible blindness in the world. Recently, there has ...
Allan Tucker, David Garway-Heath
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 1 months ago
Quadratic Goldreich-Levin Theorems
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Madhur Tulsiani, Julia Wolf
IPSN
2011
Springer
13 years 1 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 9 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
« Prev « First page 1013 / 1017 Last » Next »