Sciweavers

248 search results - page 39 / 50
» Parameterized Algorithms for Directed Maximum Leaf Problems
Sort
View
MOBICOM
2012
ACM
12 years 12 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
ANCS
2009
ACM
14 years 7 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin
76
Voted
GLOBECOM
2006
IEEE
15 years 3 months ago
Topology Control for Constant Rate Mobile Networks
Abstract— Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is throu...
Liang Zhao, Errol L. Lloyd, S. S. Ravi
77
Voted
IRI
2005
IEEE
15 years 3 months ago
Handling missing values via decomposition of the conditioned set
In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly impr...
Mei-Ling Shyu, Indika Kuruppu-Appuhamilage, Shu-Ch...
INFOCOM
2005
IEEE
15 years 3 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash