1191 search results - page 199 / 239 » Completeness and Performance Of The APO Algorithm |
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
POPL
1992
ACM
15 years 1 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
DEXA
2008
Springer
14 years 11 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
ATMOS
2007
14 years 11 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
115
click to vote
FPGA
2010
ACM
14 years 10 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...