Sciweavers

1552 search results - page 257 / 311
» On the Complexity of Constant Propagation
Sort
View
CVPR
2012
IEEE
13 years 2 months ago
Cross-based local multipoint filtering
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
Jiangbo Lu, Keyang Shi, Dongbo Min, Liang Lin, Min...
CVPR
2012
IEEE
13 years 2 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
SPAA
2009
ACM
16 years 11 days ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
PODC
2009
ACM
16 years 11 days ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 4 days ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin