Sciweavers

1830 search results - page 128 / 366
» Workshop on Graph Computation Models
Sort
View
138
Voted
ICALP
2004
Springer
15 years 10 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
GD
2003
Springer
15 years 9 months ago
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 4 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
INFOCOM
2007
IEEE
15 years 10 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...
WSC
1998
15 years 5 months ago
Customer Interfacing - Lessons Learned
Customer interfacing is the process through which one works with and relates to their customer. Often in the technical world, modelers find it easier to interface with computers r...
David M. Ferrin, Richard P. Lavecchia