Sciweavers

82 search results - page 7 / 17
» No four subsets forming an N
Sort
View
STACS
1999
Springer
13 years 11 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 7 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
IJCAI
1989
13 years 8 months ago
Real-Time AI Systems: A Definition and An Architecture
Speed alone is insufficient for real-time performance. We define real-time performance in terms of speed, responsiveness, timeliness, and graceful adaptation. We claim that all fo...
Rajendra T. Dodhiawala, N. S. Sridharan, Peter Rau...
PODC
1997
ACM
13 years 11 months ago
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool
AVSS
2007
IEEE
14 years 1 months ago
Experiments with patch-based object classification
We present and experiment with a patch-based algorithm for the purpose of object classification in video surveillance. A feature vector is calculated based on template matching o...
Rob G. J. Wijnhoven, Peter H. N. de With