Sciweavers

406 search results - page 52 / 82
» Privacy-Preserving Set Union
Sort
View
ICWSM
2008
13 years 9 months ago
Wikipedia as an Ontology for Describing Documents
Identifying topics and concepts associated with a set of documents is a task common to many applications. It can help in the annotation and categorization of documents and be used...
Zareen Saba Syed, Tim Finin, Anupam Joshi
ACTA
2010
191views more  ACTA 2010»
13 years 7 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 7 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
NAR
2007
81views more  NAR 2007»
13 years 7 months ago
Pseudogene.org: a comprehensive database and comparison platform for pseudogene annotation
The Pseudogene.org database serves as a comprehensive repository for pseudogene sequence annotation. The definition of a pseudogene varies within the literature, resulting in sign...
John E. Karro, Yangpan Yan, Deyou Zheng, Zhaolei Z...
WG
2010
Springer
13 years 6 months ago
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...