1208 search results - page 225 / 242 » Uniform eventown problems |
130
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
142
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
140
click to vote
MICRO
2006
IEEE
15 years 10 months ago
2006
IEEE
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
155
click to vote
IMC
2006
ACM
15 years 10 months ago
2006
ACM
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
137
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...