Sciweavers

3775 search results - page 535 / 755
» The Expression Problem Revisited
Sort
View
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 9 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 9 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
15 years 9 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
ISARCS
2010
240views Hardware» more  ISARCS 2010»
15 years 8 months ago
Engineering a Distributed e-Voting System Architecture: Meeting Critical Requirements
Voting is a critical component of any democratic process; and electronic voting systems should be developed following best practices for critical system development. E-voting has i...
J. Paul Gibson, Eric Lallet, Jean-Luc Raffy
COLT
2008
Springer
15 years 8 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim