Sciweavers

339 search results - page 39 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks
— Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmis...
Zhenming Chen, Chunming Qiao, Jinhui Xu, Taekkyeun...
INFOCOM
2012
IEEE
11 years 11 months ago
Scaling social media applications into geo-distributed clouds
—Federation of geo-distributed cloud services is a trend in cloud computing which, by spanning multiple data centers at different geographical locations, can provide a cloud plat...
Yu Wu, Chuan Wu, Bo Li 0001, Linquan Zhang, Zongpe...
SIGIR
2005
ACM
14 years 2 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He
TPDS
2010
176views more  TPDS 2010»
13 years 7 months ago
Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
Roberto Baldoni, Angelo Corsaro, Leonardo Querzoni...
ORL
1998
116views more  ORL 1998»
13 years 8 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...