Sciweavers

3991 search results - page 161 / 799
» Bounding homogeneous models
Sort
View
ICALP
2005
Springer
14 years 1 months ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
NIPS
2001
13 years 9 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 1 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
ICIP
2005
IEEE
14 years 9 months ago
New higher-order active contour energies for network extraction
Using the framework of higher-order active contours, we present a new quadratic continuation energy for the extraction of line networks (e.g. road, hydrographic, vascular) in the ...
Marie Rochery, Ian H. Jermyn, Josiane Zerubia
ICIP
2009
IEEE
14 years 9 months ago
Illumination Invariant Unsupervised Segmenter
A novel illumination invariant unsupervised multispectral texture segmentation method with unknown number of classes is presented. Multispectral texture mosaics are locally repres...