Sciweavers

4047 search results - page 40 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
DAM
2000
137views more  DAM 2000»
14 years 11 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
SIGMOD
2005
ACM
99views Database» more  SIGMOD 2005»
15 years 12 months ago
Query answering exploiting structural properties
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...
Francesco Scarcello
JAIR
2006
102views more  JAIR 2006»
14 years 11 months ago
Set Intersection and Consistency in Constraint Networks
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
Yuanlin Zhang, Roland H. C. Yap
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 5 days ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KELSI
2004
Springer
15 years 5 months ago
Improving Rule Induction Precision for Automated Annotation by Balancing Skewed Data Sets
There is an overwhelming increase in submissions to genomic databases, posing a problem for database maintenance, especially regarding annotation of fields left blank during submi...
Gustavo E. A. P. A. Batista, Maria Carolina Monard...