Sciweavers

2783 search results - page 341 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
BC
2005
84views more  BC 2005»
15 years 1 months ago
A computational model of monkey cortical grating cells
Grating cells were discovered in the V1 and V2 areas of the monkey visual cortex by von der Heydt et al. (1992). These cells responded vigorously to grating patterns of appropriate...
Tino Lourens, Emilia I. Barakova, Hiroshi G. Okuno...
141
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 8 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
WWW
2008
ACM
16 years 2 months ago
Learning multiple graphs for document recommendations
The Web offers rich relational data with different semantics. In this paper, we address the problem of document recommendation in a digital library, where the documents in questio...
Ding Zhou, Shenghuo Zhu, Kai Yu, Xiaodan Song, Bel...
141
Voted
ESOP
2010
Springer
15 years 11 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»
15 years 8 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