4539 search results - page 595 / 908 » Approaches to Compute Workflow Complexity |
210
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
166
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
198
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
187
click to vote
ICFCA
2009
Springer
16 years 1 months ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
190
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...