531 search results - page 62 / 107 » Data structure repair using goal-directed reasoning |
157
Voted
KDD
2004
ACM
16 years 5 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
163
click to vote
RSS
2007
15 years 6 months ago
2007
Abstract— This paper considers the problem of learning to recognize different terrains from color imagery in a fully automatic fashion, using the robot’s mechanical sensors as ...
159
click to vote
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
241
click to vote
ASPLOS
2011
ACM
14 years 8 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
143
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...