Sciweavers

1859 search results - page 38 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ICCV
2007
IEEE
15 years 9 months ago
Fast Automatic Heart Chamber Segmentation from 3D CT Data Using Marginal Space Learning and Steerable Features
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
Yefeng Zheng, Adrian Barbu, Bogdan Georgescu, Mich...
130
Voted
CVPR
2001
IEEE
16 years 4 months ago
Small Sample Learning during Multimedia Retrieval using BiasMap
All positive examples are alike; each negative example is negative in its own way. During interactive multimedia information retrieval, the number of training samples fed-back by ...
Xiang Sean Zhou, Thomas S. Huang
125
Voted
FOCS
2005
IEEE
15 years 8 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
191
Voted
CVPR
2012
IEEE
13 years 5 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
102
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 8 months ago
Evolving computer intrusion scripts for vulnerability assessment and log analysis
Evolutionary computation is used to construct undetectable computer attack scripts. Using a simulated operating system, we show that scripts can be evolved to cover their tracks a...
Julien Budynek, Eric Bonabeau, Ben Shargel