Sciweavers

1461 search results - page 268 / 293
» Complexity of Graph Covering Problems
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 8 months ago
Co-evolution of social and affiliation networks
In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generati...
Elena Zheleva, Hossam Sharara, Lise Getoor
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
14 years 8 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
JSSPP
2009
Springer
14 years 2 months ago
Job Admission and Resource Allocation in Distributed Streaming Systems
Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantitie...
Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Suja...