Sciweavers

1686 search results - page 16 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
A String of Feature Graphs Model for Recognition of Complex Activities in Natural Videos
Videos usually consist of activities involving interactions between multiple actors, sometimes referred to as complex activities. Recognition of such activities requires modeling ...
Utkarsh Gaur, Yingying Zhu, Bi Song, Amit Roy-Chow...
POPL
2012
ACM
13 years 5 months ago
Analysis of recursively parallel programs
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
Ahmed Bouajjani, Michael Emmi
CVPR
2012
IEEE
13 years 1 days 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
69
Voted
MP
1998
83views more  MP 1998»
14 years 9 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
84
Voted
FAC
2002
78views more  FAC 2002»
14 years 9 months ago
A Refinement Calculus for Shared-Variable Parallel and Distributed Programming
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...
Jürgen Dingel