Sciweavers

1998 search results - page 357 / 400
» Complexity of the Cover Polynomial
Sort
View
TMI
2010
208views more  TMI 2010»
13 years 4 months ago
Patient-Specific Modeling and Quantification of the Aortic and Mitral Valves From 4-D Cardiac CT and TEE
As decisions in cardiology increasingly rely on non-invasive methods, fast and precise image processing tools have become a crucial component of the analysis workflow. To the best ...
Razvan Ioan Ionasec, Ingmar Voigt, Bogdan Georgesc...
ICCV
2007
IEEE
14 years 12 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
WWW
2009
ACM
14 years 10 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 10 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
MOBIHOC
2009
ACM
14 years 4 months ago
Revenue generation for truthful spectrum auction in dynamic spectrum access
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
Juncheng Jia, Qian Zhang, Qin Zhang, Mingyan Liu