340 search results - page 27 / 68 » Efficient algorithms for bichromatic separability |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
112
click to vote
WAN
1998
Springer
15 years 1 months ago
1998
Springer
We present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combine...
CCGRID
2010
IEEE
14 years 10 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
83
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...