2542 search results - page 207 / 509 » Computing Cartograms with Optimal Complexity |
156
Voted
MOBIHOC
2012
ACM
13 years 3 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
108
click to vote
ISVC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we present a facial expression recognition method using feature-adaptive motion energy analysis. Our method is simplicityoriented and avoids complicated face model r...
103
click to vote
PR
2007
15 years 6 days ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
126
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...
94
Voted
ICRA
2010
IEEE
14 years 11 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...