Sciweavers

7930 search results - page 1555 / 1586
» Greedy in Approximation Algorithms
Sort
View
FOCS
2002
IEEE
14 years 1 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
ICPR
2002
IEEE
14 years 1 months ago
Feasibility of Hough-Transform-Based Iris Localisation for Real-Time-Application
We present a fast method for locating iris features in frontal face images based on the Hough transform. It consists of an initial iris detection step and a tracking step which us...
Klaus D. Tönnies, Frank Behrens, Melanie Aurn...
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
14 years 1 months ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi
ICALP
2010
Springer
14 years 1 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
« Prev « First page 1555 / 1586 Last » Next »