Sciweavers

1285 search results - page 129 / 257
» On the Complexity of Ordinal Clustering
Sort
View
CVPR
2007
IEEE
15 years 6 days ago
Detection and segmentation of moving objects in highly dynamic scenes
Detecting and segmenting moving objects in dynamic scenes is a hard but essential task in a number of applications such as surveillance. Most existing methods only give good resul...
Aurélie Bugeau, Patrick Pérez
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
14 years 4 months ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
CCGRID
2008
IEEE
14 years 4 months ago
Application Resilience: Making Progress in Spite of Failure
Abstract—While measures such as raw compute performance and system capacity continue to be important factors for evaluating cluster performance, such issues as system reliability...
William M. Jones, John T. Daly, Nathan DeBardelebe...
CLUSTER
2008
IEEE
14 years 4 months ago
Active storage using object-based devices
—The increasing performance and decreasing cost of processors and memory are causing system intelligence to move from the CPU to peripherals such as disk drives. Storage system d...
Tina Miriam John, Anuradharthi Thiruvenkata Ramani...