Sciweavers

10493 search results - page 1962 / 2099
» Dynamic Word Problems
Sort
View
JCB
2002
70views more  JCB 2002»
13 years 7 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
JIRS
2002
137views more  JIRS 2002»
13 years 7 months ago
Mobile Robot Command by Man-Machine Co-Operation - Application to Disabled and Elderly People Assistance
Disabled people assistance is developing thanks to progress of new technologies. A manipulator arm mounted on a mobile robot can assist the disabled person for the partial restora...
Philippe Hoppenot, Etienne Colle
SIAMCOMP
1998
113views more  SIAMCOMP 1998»
13 years 7 months ago
Two-Dimensional Periodicity in Rectangular Arrays
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
Amihood Amir, Gary Benson
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 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»
13 years 7 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
« Prev « First page 1962 / 2099 Last » Next »