Sciweavers

4781 search results - page 601 / 957
» Online algorithms for network design
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Adaptive resolution-constrained scalar multiple-description coding
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
Janusz Klejsa, Marcin Kuropatwinski, W. Bastiaan K...
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
156
Voted
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 3 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
IJCNN
2007
IEEE
16 years 1 months ago
Iterative Feature Selection in Gaussian Mixture Clustering with Automatic Model Selection
— This paper proposes an algorithm to deal with the feature selection in Gaussian mixture clustering by an iterative way: the algorithm iterates between the clustering and the un...
Hong Zeng, Yiu-ming Cheung