Sciweavers

1170 search results - page 79 / 234
» Experience with Ripple-Down Rules
Sort
View
CHI
2011
ACM
14 years 1 months ago
Playable data: characterizing the design space of game-y infographics
This work explores the intersection between infographics and games by examining how to embed meaningful visual analytic interactions into game mechanics that in turn impact user b...
Nicholas Diakopoulos, Funda Kivran-Swaine, Mor Naa...
WWW
2011
ACM
14 years 4 months ago
Improving recommendation for long-tail queries via templates
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
Idan Szpektor, Aristides Gionis, Yoelle Maarek
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 10 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
ICPR
2002
IEEE
15 years 11 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
WOSP
2010
ACM
15 years 4 months ago
A page fault equation for dynamic heap sizing
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to autom...
Y. C. Tay, X. R. Zong