Sciweavers

644 search results - page 54 / 129
» Decomposition Complexity
Sort
View
122
Voted
ECCV
2010
Springer
15 years 4 months ago
Modeling Temporal Structure of Decomposable Motion Segments for Activity Classification
Abstract. Much recent research in human activity recognition has focused on the problem of recognizing simple repetitive (walking, running, waving) and punctual actions (sitting up...
100
Voted
CSCW
2012
ACM
13 years 8 months ago
Collaboratively crowdsourcing workflows with turkomatic
Preparing complex jobs for crowdsourcing marketplaces requires careful attention to workflow design, the process of decomposing jobs into multiple tasks, which are solved by multi...
Anand Pramod Kulkarni, Matthew Can, Björn Har...
PDPTA
2008
15 years 2 months ago
A Parallel Processing Architecture for Solving Large-Scale Linear Systems
Solving linear systems with a large number of variables is at the core of many scienti c problems. Parallel processing techniques for solving such systems have received much attent...
Arun Nagari, Itamar Elhanany, Ben Thompson, Fangxi...
80
Voted
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
15 years 6 months ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
IJAC
2006
87views more  IJAC 2006»
15 years 18 days ago
Evaluation Properties of Symmetric Polynomials
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
Pierrick Gaudry, Éric Schost, Nicolas M. Th...