Sciweavers

4066 search results - page 32 / 814
» Almost Complete Sets
Sort
View
IALP
2009
13 years 7 months ago
A Modular Cascaded Approach to Complete Parsing
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
Samar Husain, Phani Gadde, Bharat Ram Ambati, Dipt...
GC
2012
Springer
12 years 5 months ago
Covering Complete Hypergraphs with Cuts of Minimum Total Size
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...
Sebastian M. Cioaba, André Kündgen
ACCV
1998
Springer
14 years 2 months ago
Optimising the Complete Image Feature Extraction Chain
The hypothesis veri cation stage of the traditional image processing approach, consisting of low, medium, and high level processing, will su er if the set of low level features ext...
Majid Mirmehdi, Phil L. Palmer, Josef Kittler
MLMI
2007
Springer
14 years 4 months ago
Modeling Vocal Interaction for Segmentation in Meeting Recognition
Automatic segmentation is an important technology for both automatic speech recognition and automatic speech understanding. In meetings, participants typically vocalize for only a ...
Kornel Laskowski, Tanja Schultz
LPNMR
1997
Springer
14 years 2 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds