Sciweavers

215 search results - page 2 / 43
» An Improvement of a Function Computing Normalizers for Permu...
Sort
View
TLCA
2001
Springer
13 years 9 months ago
Strong Normalization of Classical Natural Deduction with Disjunction
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
Philippe de Groote
FOCS
1992
IEEE
13 years 9 months ago
Computing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
Eugene M. Luks
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
13 years 10 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
WSC
2004
13 years 6 months ago
Permuted Weighted Area Estimators
Calvin and Nakayama previously introduced permuting as a way of improving existing standardized time series methods. The basic idea is to split a simulated sample path into nonove...
James M. Calvin, Marvin K. Nakayama
ICPR
2004
IEEE
14 years 6 months ago
Improving Cut Detection in MPEG Videos by GOP-Oriented Frame Difference Normalization
The detection of abrupt shot changes ("cuts") in videos is a basic step in video content analysis. Many cut detection algorithms based on histogram differences have been...
Bernd Freisleben, Ralph Ewerth