Sciweavers

953 search results - page 161 / 191
» Constraint Based Transformation Theory
Sort
View
ICDT
2009
ACM
198views Database» more  ICDT 2009»
14 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
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 10 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
POPL
2004
ACM
14 years 10 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 9 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
ICCAD
2006
IEEE
93views Hardware» more  ICCAD 2006»
14 years 6 months ago
Precise identification of the worst-case voltage drop conditions in power grid verification
– Identifying worst-case voltage drop conditions in every module supplied by the power grid is a crucial problem in modern IC design. In this paper we develop a novel methodology...
Nestoras E. Evmorfopoulos, Dimitris P. Karampatzak...