Sciweavers

491 search results - page 49 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
ICC
2009
IEEE
200views Communications» more  ICC 2009»
14 years 2 months ago
Fast Distributed Multi-Cell Scheduling with Delayed Limited-Capacity Backhaul Links
— Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a c...
Ralf Bendlin, Yih-Fang Huang, Michel T. Ivrlac, Jo...
PERCOM
2004
ACM
14 years 7 months ago
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
Regina Bischoff, Roger Wattenhofer
ICNP
1999
IEEE
14 years 8 days ago
Dynamic Memory Model Based Framework for Optimization of IP Address Lookup Algorithms
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
Gene Cheung, Steven McCanne
FTDCS
1995
IEEE
13 years 11 months ago
A Network Channel Buffer Scheduling Algorithm for an Interactive VOD Server
A VOD server handles various types of media such as continuous media (CM) and non-continuous media (NM). Conventional VOD server buffer scheduling algorithms like Round Robin (RR)...
Sungyoung Lee, Hyungill Kim, Jongwon Lee
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
13 years 3 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens