464 search results - page 41 / 93 » Subsystem Based Generalizations of Rough Set Approximations |
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider a model of a 3D image obtained by discretizing it into a multiresolution tetrahedral mesh known as a hierarchy of diamonds. This model enables us to extract crack-free...
EUROCAST
2005
Springer
15 years 5 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
195
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
130
click to vote
SIGCOMM
2010
ACM
14 years 12 months ago
2010
ACM
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...