2492 search results - page 103 / 499 » On the General Signature Trees |
167
click to vote
ICRA
2008
IEEE
16 years 24 days ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
171
click to vote
ICNP
2003
IEEE
15 years 11 months ago
2003
IEEE
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
158
click to vote
IANDC
2007
15 years 6 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
140
click to vote
LICS
2007
IEEE
16 years 19 days ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
164
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...