4255 search results - page 157 / 851 » Cover |
127
click to vote
ASUNAM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
129
click to vote
LREC
2010
15 years 5 months ago
2010
The paper presents the fourth, "Mondilex" edition of the MULTEXT-East language resources, a multilingual dataset for language engineering research and development, focus...
126
click to vote
ICMLA
2007
15 years 5 months ago
2007
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
129
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
121
click to vote
BIS
2006
15 years 5 months ago
2006
In this paper we discuss the possible application of new concepts in web content extraction: utility assessment, utility annealing, and dynamic aggregated document generation. Aft...