160 search results - page 27 / 32 » Sparse decompositions in |
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
JMLR
2006
14 years 10 months ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
AES
2005
Springer
14 years 10 months ago
2005
Springer
This paper is intended as a contribution to enhance orthogonal collocation methods. In this, a novel collocation method--TH-collocation--is applied to the biharmonic equation and ...
114
click to vote
EC
1998
14 years 10 months ago
1998
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...