Sciweavers

3130 search results - page 29 / 626
» Collusion without communication
Sort
View
GD
2001
Springer
15 years 9 months ago
Orthogonal Drawings of Plane Graphs without Bends
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
CHI
2004
ACM
16 years 4 months ago
Pointing without a pointer
We present a method for performing selection tasks based on continuous control of multiple, competing agents who try to determine the user's intentions from their control beh...
John Williamson, Roderick Murray-Smith
119
Voted
CISS
2008
IEEE
15 years 11 months ago
Frames for linear reconstruction without phase
Abstract— The objective of this paper is the linear reconstruction of a vector, up to a unimodular constant, when all phase information is lost, meaning only the magnitudes of fr...
Bernhard G. Bodmann, Peter G. Casazza, Dan Edidin,...
152
Voted
LCN
2008
IEEE
15 years 11 months ago
Spatially Disjoint Multipath Routing protocol without location information
—Multipath routing permits the discovery and use of multiple paths between a source and a destination. We develop a distributed on-demand multipath routing protocol for MANETs ca...
Juan Jose Galvez, Pedro M. Ruiz, Antonio F. G&oacu...
SIGCOMM
2006
ACM
15 years 10 months ago
Designing DCCP: congestion control without reliability
DCCP, the Datagram Congestion Control Protocol, is a new transport protocol in the TCP/UDP family that provides a congestion-controlled flow of unreliable datagrams. Delay-sensit...
Eddie Kohler, Mark Handley, Sally Floyd