1702 search results - page 139 / 341 » Using Nondeterminism to Design Efficient Deterministic Algor... |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
DEXA
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data inte...
PADL
2010
Springer
14 years 8 days ago
2010
Springer
Newer Prolog implementations commonly offer support for multi-threading, and have also begun to offer support for tabling. However, most implementations do not yet integrate tablin...
MOBIHOC
2009
ACM
14 years 11 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...