4539 search results - page 611 / 908 » Approaches to Compute Workflow Complexity |
212
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
191
click to vote
TDSC
2011
15 years 1 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
186
click to vote
TIP
2010
15 years 1 months ago
2010
Particle filters (PFs) are Bayesian filters capable of modeling nonlinear, non-Gaussian, and nonstationary dynamical systems. Recent research in PFs has investigated ways to approp...
207
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
176
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...