Sciweavers

70 search results - page 4 / 14
» A Case for Decomposition of FIFO Networks
Sort
View
RECOMB
2009
Springer
15 years 10 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
INFORMATICALT
2010
119views more  INFORMATICALT 2010»
14 years 8 months ago
Tight Arrival Curve at the Output of a Work-Conserving Blind Multiplexing Server
Abstract. As a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less comple...
Juan Echagüe, Vicent Cholvi
MOC
2002
144views more  MOC 2002»
14 years 9 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng
77
Voted
JMLR
2010
159views more  JMLR 2010»
14 years 4 months ago
Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
Nikolai Slavov
LCN
2008
IEEE
15 years 4 months ago
Speedo: Realistic achievable bandwidth in 802.11 through passive monitoring
—End to end available bandwidth is often constrained by IEEE 802.11 hops in the access network. Available bandwidth measurement is particularly challenging in the wireless enviro...
Malik Ahmad Yar Khan, Darryl Veitch