Sciweavers

736 search results - page 126 / 148
» Approximating the Number of Network Motifs
Sort
View
TCOM
2008
146views more  TCOM 2008»
14 years 9 months ago
Noncoherent eigenbeamforming and interference suppression for outdoor OFDM systems
Abstract--We investigate a new approach to uplink communications in wideband outdoor cellular systems that can take advantage of multiple antennas at the base station in a scalable...
Noah Jacobsen, Gwen Barriac, Upamanyu Madhow
AAAI
2004
14 years 11 months ago
Intelligent Systems Demonstration: The Secure Wireless Agent Testbed (SWAT)
We will demonstrate the Secure Wireless Agent Testbed (SWAT), a unique facility developed at Drexel University to study integration, networking and information assurance for next-...
Gustave Anderson, Andrew Burnheimer, Vincent A. Ci...
PODC
2009
ACM
15 years 10 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
COMPGEOM
2006
ACM
15 years 3 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm