Sciweavers

5115 search results - page 845 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
ISBI
2004
IEEE
16 years 7 months ago
Speckle Reduction on Ultrasound Image by Variational Methods and Adaptive Lagrangian Multipliers
Ultrasound images are corrupted by a multiplicative noise, the speckle, which makes high level analysis difficult. Within each resolution cell a number of elementary scatterers re...
Arnaud Ogier, Pierre Hellier, Christian Barillot
ISBI
2008
IEEE
16 years 7 months ago
Knee reconstruction through efficient linear programming
In this paper we propose a novel method to recover the 3D shape of the knee and of the prosthesis for the patients that have undergone total knee replacement surgery. We address t...
Mihai Sardarescu, Nikos Paragios, Nikos Komodakis,...
WWW
2006
ACM
16 years 7 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
WWW
2005
ACM
16 years 7 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...