Sciweavers

206 search results - page 34 / 42
» Weak Alternating Automata Are Not That Weak
Sort
View
AI
2008
Springer
13 years 7 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
IJHCI
2006
95views more  IJHCI 2006»
13 years 7 months ago
Problem Prioritization in Usability Evaluation: From Severity Assessments Toward Impact on Design
Severity assessments enable prioritization of problems encountered during usability evaluations and thereby provide a device for guiding the utilization of design resources. Howeve...
Morten Hertzum
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
IS
2006
13 years 7 months ago
The Michigan benchmark: towards XML query performance diagnostics
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level b...
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish...
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Posted prices vs. negotiations: an asymptotic analysis
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
Liad Blumrosen, Thomas Holenstein