15 search results - page 1 / 3 » Timestamping Algorithms: A Characterization and a Few Proper... |
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
MICRO
2002
IEEE
13 years 9 months ago
2002
IEEE
A value’s degree of use—the number of dynamic uses of that value—provides the most essential information needed to optimize its communication. We present simulation results ...
IJCV
2006
13 years 4 months ago
2006
Gesture and speech are co-expressive and complementary channels of a single human language system. While speech carries the major load of symbolic presentation, gesture provides th...