Sciweavers

15033 search results - page 322 / 3007
» Complexity Theory and Algorithms
Sort
View
ECCV
2008
Springer
15 years 7 months ago
Multi-thread Parsing for Recognizing Complex Events in Videos
This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...
Zhang Zhang, Kaiqi Huang, Tieniu Tan
CC
2010
Springer
135views System Software» more  CC 2010»
15 years 6 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
TSP
2008
154views more  TSP 2008»
15 years 5 months ago
Algebraic Signal Processing Theory: 1-D Space
In our paper titled "Algebraic Signal Processing Theory: Foundation and 1-D Time" appearing in this issue of the IEEE TRANSACTIONS ON SIGNAL PROCESSING, we presented the ...
Markus Püschel, José M. F. Moura
FOCS
1990
IEEE
15 years 10 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet
IPL
2006
139views more  IPL 2006»
15 years 6 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
Morteza Fayyazi, David R. Kaeli, Waleed Meleis