Sciweavers

1302 search results - page 218 / 261
» Fair Equivalence Relations
Sort
View
ICASSP
2011
IEEE
13 years 21 days ago
Robust nonparametric regression by controlling sparsity
Nonparametric methods are widely applicable to statistical learning problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeat...
Gonzalo Mateos, Georgios B. Giannakis
CVIU
2011
13 years 15 days ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
ICALP
2011
Springer
13 years 13 days ago
Content Search through Comparisons
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
Amin Karbasi, Stratis Ioannidis, Laurent Massouli&...
ESOP
2010
Springer
14 years 6 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 3 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman