Sciweavers

58 search results - page 8 / 12
» Relating Equivalence and Reducibility to Sparse Sets
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 7 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
DLT
2003
13 years 9 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
APAL
2007
79views more  APAL 2007»
13 years 7 months ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour
CVPR
2004
IEEE
14 years 9 months ago
Optimizing Motion Estimation with Linear Programming and Detail-Preserving Variational Method
In this paper, we propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the...
Hao Jiang, Ze-Nian Li, Mark S. Drew
IEEEICCI
2005
IEEE
14 years 1 months ago
Theoretical study on a new information entropy and its use in attribute reduction
The positive region in rough set framework and Shannon conditional entropy are two traditional uncertainty measurements, used usually as heuristic metrics in attribute reduction. ...
Ping Luo, Qing He, Zhongzhi Shi