Sciweavers

15033 search results - page 316 / 3007
» Complexity Theory and Algorithms
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
SYNASC
2007
IEEE
138views Algorithms» more  SYNASC 2007»
16 years 12 days ago
Some Applications of Weakly Picard Operators
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
Ioan A. Rus
BPM
2006
Springer
111views Business» more  BPM 2006»
15 years 8 months ago
Process Mining and Petri Net Synthesis
The theory of regions and the algorithms for synthesizing a Petri net model from a transition system, which are based on this theory, have interesting practical applications
Ekkart Kindler, Vladimir Rubin, Wilhelm Schäf...
DM
2008
123views more  DM 2008»
15 years 6 months ago
Graphic sequences with a realization containing a generalized friendship graph
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
Jian-Hua Yin, Gang Chen, John R. Schmitt
169
Voted
COLT
2007
Springer
16 years 9 days ago
Transductive Rademacher Complexity and Its Applications
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
Ran El-Yaniv, Dmitry Pechyony