Sciweavers

16430 search results - page 286 / 3286
» On Computable Tree Functions
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 8 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
ICIP
2000
IEEE
16 years 6 months ago
Multichannel Image Compression by Bijection Mappings onto Zero-Trees
A new approach to multichannel image compression is introduced where the intra- and cross-band correlations are jointly exploited in a surprisingly simple yet very effective manner...
José L. Paredes, Gonzalo R. Arce, Leonard E...
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
16 years 6 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
ICCAD
2002
IEEE
129views Hardware» more  ICCAD 2002»
16 years 1 months ago
Transmission line design of clock trees
We investigate appropriate regimes for transmission line propagation of signals on digital integrated circuits. We start from exact solutions to the transmission line equations pr...
Rafael Escovar, Roberto Suaya
CP
2003
Springer
15 years 10 months ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...