Sciweavers

2294 search results - page 114 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
WWW
2004
ACM
15 years 10 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 4 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
ICDCSW
2009
IEEE
15 years 4 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
DAS
2010
Springer
15 years 1 months ago
A post-processing scheme for malayalam using statistical sub-character language models
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
Karthika Mohan, C. V. Jawahar