Sciweavers

2124 search results - page 260 / 425
» Aggregating time partitions
Sort
View
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 8 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
CCCG
2006
15 years 8 months ago
Rotationally Monotone Polygons
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Ste...
ECRTS
2010
IEEE
15 years 7 months ago
Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, static timing analyses mu...
Daniel Grund, Jan Reineke
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 6 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
IJON
2008
173views more  IJON 2008»
15 years 6 months ago
Support vector machine classification for large data sets via minimum enclosing ball clustering
Support vector machine (SVM) is a powerful technique for data classification. Despite of its good theoretic foundations and high classification accuracy, normal SVM is not suitabl...
Jair Cervantes, Xiaoou Li, Wen Yu, Kang Li