5924 search results - page 216 / 1185 » Normal Process Representatives |
155
click to vote
MICS
2010
15 years 1 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
214
click to vote
CLEF
2011
Springer
14 years 6 months ago
2011
Springer
Abstract In this paper, we describe a novel approach to intrinsic plagiarism detection. Each suspicious document is divided into a series of consecutive, potentially overlapping â€...
208
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
219
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
206
click to vote
ICTAI
2008
IEEE
16 years 23 days ago
2008
IEEE
Ontologies are a well-motivated formal representation to model knowledge needed to extract and encode data from text. Yet, their tight integration with Information Extraction (IE)...