Sciweavers

1686 search results - page 161 / 338
» Programs as polygraphs: computability and complexity
Sort
View
147
Voted
CLOUDCOM
2010
Springer
15 years 1 months ago
Evaluation of MapReduce for Gridding LIDAR Data
-- The MapReduce programming model, introduced by Google, has become popular over the past few years as a mechanism for processing large amounts of data, using sharednothing parall...
Sriram Krishnan, Chaitanya K. Baru, Christopher J....
166
Voted
EMNLP
2010
15 years 1 months ago
Assessing Phrase-Based Translation Models with Oracle Decoding
Extant Statistical Machine Translation (SMT) systems are very complex softwares, which embed multiple layers of heuristics and embark very large numbers of numerical parameters. A...
Guillaume Wisniewski, Alexandre Allauzen, Fran&cce...
156
Voted
IEEESCC
2009
IEEE
15 years 1 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
128
Voted
CHI
2011
ACM
14 years 7 months ago
The aligned rank transform for nonparametric factorial analyses using only anova procedures
Nonparametric data from multi-factor experiments arise often in human-computer interaction (HCI). Examples may include error counts, Likert responses, and preference tallies. But ...
Jacob O. Wobbrock, Leah Findlater, Darren Gergle, ...
148
Voted
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
16 years 3 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman