Sciweavers

464 search results - page 52 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 12 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang
RECOMB
2006
Springer
16 years 4 days ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
INFOCOM
2008
IEEE
15 years 6 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
CG
2002
Springer
14 years 11 months ago
Towards robust broadcasting of geometry data
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
Stephan Bischoff, Leif Kobbelt
TIT
2008
98views more  TIT 2008»
14 years 11 months ago
Multiuser Successive Refinement and Multiple Description Coding
We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes...
Chao Tian, Jun Chen, Suhas N. Diggavi