Sciweavers

4781 search results - page 471 / 957
» Complexity at large
Sort
View
AAAI
1998
15 years 8 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
AAAI
2000
15 years 8 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
COLING
2000
15 years 8 months ago
Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
Miles Osborne
ANLP
1997
78views more  ANLP 1997»
15 years 8 months ago
EasyEnglish: A Tool for Improving Document Quality
We describe the authoring tool, EasyEnglish, which is part of IBM's internal SGML editing environment, Information Development Workbench. EasyEnglish helps writers produce cl...
Arendse Bernth
NIPS
2000
15 years 8 months ago
Learning and Tracking Cyclic Human Motion
We present methods for learning and tracking human motion in video. We estimate a statistical model of typical activities from a large set of 3D periodic human motion data by segm...
Dirk Ormoneit, Hedvig Sidenbladh, Michael J. Black...