Sciweavers

2266 search results - page 140 / 454
» Generalizing parametric timing analysis
Sort
View
98
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
146
Voted
JSSPP
2009
Springer
15 years 10 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
151
Voted
TKDE
2012
253views Formal Methods» more  TKDE 2012»
13 years 6 months ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002
142
Voted
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 4 months ago
Spotting out emerging artists using geo-aware analysis of P2P query strings
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
Noam Koenigstein, Yuval Shavitt, Tomer Tankel
150
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...