Sciweavers

3934 search results - page 250 / 787
» Approximate Schedulability Analysis
Sort
View
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 10 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
BMCBI
2006
138views more  BMCBI 2006»
15 years 6 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
MST
2010
187views more  MST 2010»
15 years 1 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
MOBIHOC
2008
ACM
16 years 6 months ago
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
Karthikeyan Sundaresan, Sampath Rangarajan
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 7 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan