Sciweavers

2542 search results - page 218 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
100
Voted
SIGCSE
2006
ACM
158views Education» more  SIGCSE 2006»
15 years 6 months ago
Evaluations of target tracking in wireless sensor networks
Target tracking is one of the most important applications of wireless sensor networks. Optimized computation and energy dissipation are critical requirements to maximize the lifet...
Sam Phu Manh Tran, T. Andrew Yang
ICNP
1999
IEEE
15 years 5 months ago
Minimum Rate Guarantee Without Per-Flow Information
This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The proto...
Yuseok Kim, Wei Kang Tsai, Mahadevan Iyer, Jordi R...
118
Voted
SCN
2010
Springer
122views Communications» more  SCN 2010»
14 years 11 months ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo
CVPR
2012
IEEE
13 years 3 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 6 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang