1170 search results - page 29 / 234 » How Fast Is Too Fast |
ESA
2004
Springer
15 years 6 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
115
click to vote
RANDOM
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
139
Voted
ICALP
1994
Springer
15 years 5 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
111
Voted
DASFAA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. A key issue to address in biological data integration is how to detect changes to the underlying biological data sources. In this demonstration, we present a novel system...
139
click to vote
SCAI
2008
15 years 2 months ago
2008
Abstract. A reinforcement architecture is introduced that consists of three complementary learning systems with different generalization abilities. The ACTOR learns state-action as...