Sciweavers

28 search results - page 1 / 6
» The Structure and Complexity of Sports Elimination Numbers
Sort
View
ALGORITHMICA
2002
70views more  ALGORITHMICA 2002»
13 years 4 months ago
The Structure and Complexity of Sports Elimination Numbers
Dan Gusfield, Charles U. Martel
ATAL
2009
Springer
13 years 11 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
CVPR
2012
IEEE
11 years 7 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
IEEESCC
2009
IEEE
13 years 2 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
ICC
2007
IEEE
110views Communications» more  ICC 2007»
13 years 11 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon