Sciweavers

3818 search results - page 650 / 764
» Word Problems on Compressed Words
Sort
View
NIPS
2001
14 years 11 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 11 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
14 years 11 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
AIEDAM
2007
105views more  AIEDAM 2007»
14 years 10 months ago
Biomimetic design through natural language analysis to facilitate cross-domain information retrieval
Biomimetic, or biologically inspired, design uses analogous biological phenomena to develop solutions for engineering problems. Several instances of biomimetic design result from ...
Ivey Chiu, L. H. Shu
PRL
2006
221views more  PRL 2006»
14 years 10 months ago
Towards on-line saccade planning for high-resolution image sensing
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...
Alberto Del Bimbo, Federico Pernici