Sciweavers

31 search results - page 4 / 7
» Combinatorial Network Abstraction by Trees and Distances
Sort
View
RECOMB
2009
Springer
14 years 8 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...
SECON
2008
IEEE
14 years 1 months ago
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks
Abstract—In this paper, we propose and evaluate two distributed protocols for finding low-cost broadcast and multicast trees in wireless networks. The constructed trees can then...
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fek...
WINE
2005
Springer
100views Economy» more  WINE 2005»
14 years 28 days ago
A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Va...
VTC
2006
IEEE
138views Communications» more  VTC 2006»
14 years 1 months ago
Simulated Annealing based Wireless Sensor Network Localization with Flip Ambiguity Mitigation
Abstract— Accurate self-localization capability is highly desirable in wireless sensor networks. A major problem in wireless sensor network localization is the flip ambiguity, w...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
SSD
2007
Springer
133views Database» more  SSD 2007»
14 years 1 months ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...