340 search results - page 5 / 68 » ets 2009 |
SAGT
2009
Springer
15 years 4 months ago
2009
Springer
Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h]n , has expected profit E[P(b)]. Aggarwal et al. showed that given A, ...
BIOSIG
2009
14 years 8 months ago
2009
: In ACISP'07, Bringer et al proposed a new approach for remote biometric based verification, which consists of a hybrid protocol that distributes the server side functionalit...
EMNLP
2009
14 years 8 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
77
Voted
CORR
2009
Springer
14 years 8 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...