Sciweavers

1942 search results - page 249 / 389
» HINT: A new way to measure computer performance
Sort
View
SAC
2010
ACM
15 years 1 months ago
Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...
MOBISYS
2011
ACM
14 years 9 months ago
Indoor localization without infrastructure using the acoustic background spectrum
We introduce a new technique for determining a mobile phone’s indoor location even when Wi-Fi infrastructure is unavailable or sparse. Our technique is based on a new ambient so...
Stephen P. Tarzia, Peter A. Dinda, Robert P. Dick,...
CONEXT
2009
ACM
15 years 7 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein
ARITH
2003
IEEE
15 years 11 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
ECCV
2010
Springer
15 years 11 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...