Sciweavers

529 search results - page 71 / 106
» Optimizing the distribution of large data sets in theory and...
Sort
View
SPAA
1996
ACM
13 years 12 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
CORR
2007
Springer
153views Education» more  CORR 2007»
13 years 7 months ago
Power-Bandwidth Tradeoff in Dense Multi-Antenna Relay Networks
— We consider a dense fading multi-user network with multiple active multi-antenna source-destination pair terminals communicating simultaneously through a large common set of K ...
Ozgur Oyman, Arogyaswami Paulraj
MDM
2007
Springer
209views Communications» more  MDM 2007»
14 years 1 months ago
Parallelized Simulated Annealing for Model Updating in Ad-Hoc Wireless Sensing Networks
The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for den...
Andrew T. Zimmerman, Jerome P. Lynch
DICTA
2003
13 years 9 months ago
Algebraic Curve Fitting Support Vector Machines
An algebraic curve is defined as the zero set of a multivariate polynomial. We consider the problem of fitting an algebraic curve to a set of vectors given an additional set of v...
Christian J. Walder, Brian C. Lovell, Peter J. Koo...
ORL
1998
116views more  ORL 1998»
13 years 7 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...