Sciweavers

710 search results - page 114 / 142
» On Minimum Power Connectivity Problems
Sort
View
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
14 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
INFOCOM
1997
IEEE
14 years 2 months ago
IP Multicasting for Point-to-Point Local Distribution
While support for IP multicasting continues to spread enabling new applications, an increasing number of hosts connects to the worldwide Internet via low bandwidth Point-toPoint l...
George Xylomenos, George C. Polyzos
JDA
2008
94views more  JDA 2008»
13 years 10 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
CN
2000
96views more  CN 2000»
13 years 9 months ago
Focused Web searching with PDAs
The Stanford Power Browser project addresses the problems of interacting with the World-Wide Web through wirelessly connected Personal Digital Assistants (PDAs). These problems in...
Orkut Buyukkokten, Hector Garcia-Molina, Andreas P...
ENVSOFT
2002
129views more  ENVSOFT 2002»
13 years 9 months ago
Linking GIS and water resources management models: an object-oriented method
Many challenges are associated with the integration of geographic information systems (GISs) with models in specific applications. One of them is adapting models to the environmen...
Daene C. McKinney, Ximing Cai