Sciweavers

2944 search results - page 135 / 589
» On Well Quasi-orders on Languages
Sort
View
89
Voted
ML
2008
ACM
15 years 21 days ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
OOPSLA
2010
Springer
14 years 10 months ago
A recommender for conflict resolution support in optimistic model versioning
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
Petra Brosch, Martina Seidl, Gerti Kappel
PDPTA
2010
14 years 10 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...
120
Voted
EACL
2009
ACL Anthology
14 years 10 months ago
Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
Stephen Wan, Mark Dras, Robert Dale, Cécile...
EMNLP
2009
14 years 10 months ago
Empirical Exploitation of Click Data for Task Specific Ranking
There have been increasing needs for task specific rankings in web search such as rankings for specific query segments like long queries, time-sensitive queries, navigational quer...
Anlei Dong, Yi Chang, Shihao Ji, Ciya Liao, Xin Li...