Sciweavers

6562 search results - page 320 / 1313
» Noetherianity and Combination Problems
Sort
View
ISBI
2006
IEEE
16 years 7 months ago
Texture-based segmentation of the knee bones in MRI using phase information
This paper considers the problem of tissue classification in 3D MRI by the mean of texture analysis. The main contribution is the use of the phase of the complex MR image, to deri...
Peter Stanwell, Pierrick Bourgeat, Sébastie...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 7 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
SIGMOD
2005
ACM
87views Database» more  SIGMOD 2005»
16 years 6 months ago
When Can We Trust Progress Estimators for SQL Queries?
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
Surajit Chaudhuri, Raghav Kaushik, Ravishankar Ram...
CVPR
2010
IEEE
16 years 3 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
CP
2009
Springer
16 years 1 months ago
Using Relaxations in Maximum Density Still Life
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...