Sciweavers

3818 search results - page 751 / 764
» Word Problems on Compressed Words
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
14 years 9 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
82
Voted
TNN
1998
125views more  TNN 1998»
14 years 9 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
TCS
2002
14 years 9 months ago
A unified language processing methodology
This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodolo...
Teodor Rus
TEC
2002
81views more  TEC 2002»
14 years 9 months ago
Genetic object recognition using combinations of views
We investigate the application of genetic algorithms (GAs) for recognizing real two-dimensional (2-D) or three-dimensional (3-D) objects from 2-D intensity images, assuming that th...
George Bebis, Evangelos A. Yfantis, Sushil J. Loui...