Sciweavers

17770 search results - page 82 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 2 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
15 years 10 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
15 years 10 months ago
An exponential separation between regular and general resolution
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
Michael Alekhnovich, Jan Johannsen, Toniann Pitass...
AI
2009
Springer
15 years 1 months ago
Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
Rahmatullah Hafiz
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
14 years 11 months ago
Complexities for generalized models of self-assembly
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang K...