Sciweavers

23589 search results - page 4715 / 4718
» Uncheatable Distributed Computations
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
SASN
2004
ACM
14 years 2 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
GI
2004
Springer
14 years 1 months ago
An Architecture Concept for Mobile P2P File Sharing Services
Abstract: File-sharing in mobile networks has differing demands to a P2P architecture. Resource access and mediation techniques must follow constraints given in 2.5G/3G networks. E...
Frank-Uwe Andersen, Hermann de Meer, Ivan Dedinski...
ICCAD
2003
IEEE
141views Hardware» more  ICCAD 2003»
14 years 1 months ago
An Enhanced Multilevel Algorithm for Circuit Placement
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...
Tony F. Chan, Jason Cong, Tim Kong, Joseph R. Shin...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 1 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
« Prev « First page 4715 / 4718 Last » Next »