2370 search results - page 101 / 474 » The Characterization of Data-Accumulating Algorithms |
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper is concerned with joint Bayesian endmember extraction and linear unmixing of hyperspectral images using a spatial prior on the abundance vectors. We hypothesize that hy...
EC
2010
14 years 7 months ago
2010
A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematica...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...