Sciweavers

1828 search results - page 342 / 366
» First-Class Type Classes
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
14 years 1 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
SIGMOD
2010
ACM
170views Database» more  SIGMOD 2010»
14 years 1 months ago
Querying data provenance
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
Grigoris Karvounarakis, Zachary G. Ives, Val Tanne...
ICS
2010
Tsinghua U.
14 years 1 months ago
Streamlining GPU applications on the fly: thread divergence elimination through runtime thread-data remapping
Because of their tremendous computing power and remarkable cost efficiency, GPUs (graphic processing unit) have quickly emerged as an influential computing platform for a broad ...
Eddy Z. Zhang, Yunlian Jiang, Ziyu Guo, Xipeng She...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
14 years 1 months ago
The nullspace method - a unifying paradigm to fault detection
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
András Varga