Sciweavers

3122 search results - page 267 / 625
» A Theory of Network Equivalence
Sort
View
EDBT
2011
ACM
225views Database» more  EDBT 2011»
14 years 10 months ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
INFOCOM
2009
IEEE
16 years 1 months ago
Minimizing Delay for Multicast-Streaming in Wireless Networks with Network Coding
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
Wai-Leong Yeow, Anh Tuan Hoang, Chen-Khong Tham
SENSYS
2006
ACM
16 years 18 days ago
RBP: robust broadcast propagation in wireless networks
Varying interference levels make broadcasting an unreliable operation in low-power wireless networks. Many routing and resource discovery protocols depend on flooding (repeated pe...
Fred Stann, John S. Heidemann, Rajesh Shroff, Muha...
IJBRA
2010
134views more  IJBRA 2010»
15 years 5 months ago
Deterministic graph-theoretic algorithm for detecting modules in biological interaction networks
—Accumulating evidence suggests that biological systems exhibit modular organization. Accurate identification of modularity is vital for understanding this organization. A recen...
Roger L. Chang, Feng Luo, Stuart Johnson, Richard ...
PODC
2003
ACM
15 years 12 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing