17366 search results - page 74 / 3474 » New Revision Algorithms |
ECCC
2010
14 years 10 months ago
2010
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another defini...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
103
click to vote
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
A new adaptive algorithm, called LLMS, which employs an array image factor, IA , sandwiched in between two Least Mean Square (LMS) sections, is proposed for different applications ...
130
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...