Sciweavers

501 search results - page 64 / 101
» Rough Sets and Approximation Schemes
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley
LATIN
2010
Springer
14 years 3 months ago
The Power of Fair Pricing Mechanisms
We explore the revenue capabilities of truthful, monotone (“fair”) allocation and pricing functions for resource-constrained auction mechanisms within a general framework that ...
Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron...
COCOON
2010
Springer
14 years 1 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
WAPCV
2007
Springer
14 years 4 months ago
Language Label Learning for Visual Concepts Discovered from Video Sequences
Computational models of grounded language learning have been based on the premise that words and concepts are learned simultaneously. Given the mounting cognitive evidence for conc...
Prithwijit Guha, Amitabha Mukerjee
IMC
2006
ACM
14 years 3 months ago
Fisher information of sampled packets: an application to flow size estimation
Packet sampling is widely used in network monitoring. Sampled packet streams are often used to determine flow-level statistics of network traffic. To date there is conflicting e...
Bruno F. Ribeiro, Donald F. Towsley, Tao Ye, Jean ...