3758 search results - page 500 / 752 » A Complete Subsumption Algorithm |
318
click to vote
ASUNAM
2011
IEEE
14 years 6 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
224
click to vote
CLEF
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. This paper presents a language-independent Multilingual Document Clustering (MDC) approach on comparable corpora. Named entites (NEs) such as persons, locations, organiza...
207
click to vote
COCO
2011
Springer
14 years 6 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
193
click to vote
CONCUR
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
182
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...