4539 search results - page 431 / 908 » Approaches to Compute Workflow Complexity |
174
click to vote
CVPR
2006
IEEE
16 years 27 days ago
2006
IEEE
This paper describes a new approach to motion estimation in video. We represent video motion using a set of particles. Each particle is an image point sample with a longduration t...
165
click to vote
DSN
2006
IEEE
16 years 27 days ago
2006
IEEE
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
165
click to vote
ACMSE
2006
ACM
16 years 24 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
139
click to vote
SAC
2006
ACM
16 years 24 days ago
2006
ACM
The heterogeneity of architectural constraint languages makes difficult the transformation of architectural constraints throughout the development process. Indeed they have signi...
178
click to vote
SIGCSE
2006
ACM
16 years 24 days ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...