12825 search results - page 293 / 2565 » Improved PLSOM algorithm |
180
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
189
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
222
click to vote
JNW
2008
15 years 7 months ago
2008
Semantic Web Services (SWS) propose to extend the traditional Web Services technologies on the way to consolidate ontologies and semantics. This makes it possible to select, integr...
162
click to vote
SSDBM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popula...
201
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...