Sciweavers

4843 search results - page 398 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 5 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
MICCAI
2009
Springer
16 years 2 months ago
Fast Automatic Segmentation of the Esophagus from 3D CT Data Using a Probabilistic Model
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...
Johannes Feulner, Shaohua Kevin Zhou, Alexander Ca...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
16 years 1 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
ICCD
2004
IEEE
106views Hardware» more  ICCD 2004»
16 years 1 months ago
Gate Sizing and V{t} Assignment for Active-Mode Leakage Power Reduction
Leakage current is a key factor in IC power consumption even in the active operating mode. We investigate the simultaneous optimization of gate size and threshold voltage to reduc...
Feng Gao, John P. Hayes
138
Voted
CVPR
2010
IEEE
16 years 1 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman