837 search results - page 108 / 168 » Hard combinators |
WWW
2007
ACM
16 years 16 days ago
2007
ACM
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
213
click to vote
ICFP
2009
ACM
16 years 15 days ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
190
click to vote
ASPLOS
2009
ACM
16 years 15 days ago
2009
ACM
In a virtualized environment, device drivers are often run inside a virtual machine (VM) rather than in the hypervisor, for reasons of safety and reduction in software engineering...
189
click to vote
CC
2009
Springer
16 years 15 days ago
2009
Springer
Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelisi...
CHI
2009
ACM
16 years 13 days ago
2009
ACM
Users find it hard to delete unimportant personal information which often results in cluttered workspaces. We present a full design cycle for GrayArea, a novel interface that allo...