1321 search results - page 159 / 265 » Quadratic forms on graphs |
APPROX
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
ICFP
2005
ACM
14 years 10 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
MICAI
2005
Springer
14 years 3 months ago
2005
Springer
We propose a novel, high-level model of human learning and cognition, based on association forming. The model configures any input data stream featuring a high incidence of repeti...
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
Using beam forming antennas in ad hoc networks have been recently focused on, in order to improve the space reuse. This news context implies to revisit network algorithms because t...
NIPS
2008
13 years 11 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...