4199 search results - page 546 / 840 » Generalizing Data in Natural Language |
185
click to vote
CIKM
1993
Springer
15 years 10 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
189
click to vote
ASPLOS
2012
ACM
14 years 2 months ago
2012
ACM
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
167
click to vote
ICTAC
2004
Springer
15 years 12 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
191
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
Generally progressive procedural content in the context of 3D scene rendering is expressed as recursive functions where a finer level of detail gets computed on demand. Typical e...
153
click to vote
SIGSOFT
2006
ACM
16 years 7 months ago
2006
ACM
Property specifications concisely describe aspects of what a system is supposed to do. No matter what notation is used to describe them, however, it is difficult to represent thes...