Sciweavers

52 search results - page 10 / 11
» Improved Deletions in Dynamic Spatial Approximation Trees
Sort
View
CVPR
2006
IEEE
14 years 4 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 11 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
TMI
2010
113views more  TMI 2010»
13 years 9 months ago
Multiscale Model of Liver DCE-MRI Towards a Better Understanding of Tumor Complexity
Abstract—The use of quantitative imaging for the characterization of hepatic tumors in MRI can improve the diagnosis and therefore the treatment of these life-threatening tumors....
Muriel Mescam, Marek Kretowski, Johanne Béz...
VLSID
2002
IEEE
127views VLSI» more  VLSID 2002»
14 years 11 months ago
Switching Activity Estimation of Large Circuits using Multiple Bayesian Networks
Switching activity estimation is a crucial step in estimating dynamic power consumption in CMOS circuits. In [1], we proposed a new switching probability model based on Bayesian N...
Sanjukta Bhanja, N. Ranganathan
RECOMB
2005
Springer
14 years 11 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...