2899 search results - page 341 / 580 » Dynamic Trees in Practice |
133
Voted
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
130
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
113
Voted
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
143
Voted
CCS
2007
ACM
15 years 10 months ago
2007
ACM
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
118
Voted
CP
2007
Springer
15 years 10 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...