Sciweavers

2069 search results - page 53 / 414
» Linear time algorithms for Clobber
Sort
View
CPC
2006
110views more  CPC 2006»
15 years 3 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
WCE
2007
15 years 5 months ago
Suboptimal Filter for Multisensor Linear Discrete-Time Systems with Observation Uncertainties
The focus of this paper is the problem of recursive estimation for uncertain multisensor linear discrete-time systems. We herein propose a new suboptimal filtering algorithm. The b...
Tyagi Deepak, Vladimir Shin
PLANX
2008
15 years 5 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
15 years 4 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting
COLING
2008
15 years 5 months ago
Extracting Synchronous Grammar Rules From Word-Level Alignments in Linear Time
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
Hao Zhang, Daniel Gildea, David Chiang