Sciweavers

103 search results - page 18 / 21
» Minimal Separating Sequences for All Pairs of States
Sort
View
ALT
2009
Springer
14 years 7 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
PAMI
2010
265views more  PAMI 2010»
13 years 8 months ago
Motion Segmentation in the Presence of Outlying, Incomplete, or Corrupted Trajectories
—In this paper, we study the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this proble...
Shankar Rao, Roberto Tron, René Vidal, Yi M...
VLSID
2004
IEEE
146views VLSI» more  VLSID 2004»
14 years 10 months ago
CMOS Circuit Design for Minimum Dynamic Power and Highest Speed
{A new low-power design method produces CMOS circuits that consume the least dynamic power at the highest speed permitted under the technology constraint. A gate is characterized b...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
CSL
2006
Springer
13 years 10 months ago
Support vector machines for speaker and language recognition
Support vector machines (SVMs) have proven to be a powerful technique for pattern classification. SVMs map inputs into a high dimensional space and then separate classes with a hy...
William M. Campbell, Joseph P. Campbell, Douglas A...
WWW
2009
ACM
14 years 11 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts