Sciweavers

373 search results - page 15 / 75
» Evaluating Consistency Algorithms for Temporal Metric Constr...
Sort
View
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 5 days ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
AAAI
1992
14 years 11 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
ICDT
2009
ACM
198views Database» more  ICDT 2009»
15 years 10 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
ASPDAC
2009
ACM
155views Hardware» more  ASPDAC 2009»
15 years 4 months ago
Variation-aware resource sharing and binding in behavioral synthesis
— As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. In the presence of process variations, wo...
Feng Wang 0004, Yuan Xie, Andres Takach
ECAI
2010
Springer
14 years 7 months ago
From bursty patterns to bursty facts: The effectiveness of temporal text mining for news
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...
Ilija Subasic, Bettina Berendt