1857 search results - page 189 / 372 » Minimum Degree Orderings |
132
click to vote
ACL
1998
15 years 8 months ago
1998
This paper presents a method that conbines a set of unsupervised algorithms in order to accurately build large taxonomies from any machine-readable dictionary (MRD). Our aim is to...
162
click to vote
IJCAI
1989
15 years 7 months ago
1989
We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole&#...
158
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Browsing through collections of audio recordings of conversation nominally relies on the processing of participants’ lexical productions. The evolving verbal and non-verbal cont...
173
click to vote
ARSCOM
2007
15 years 6 months ago
2007
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...