Sciweavers

1536 search results - page 146 / 308
» Approximately Dominating Representatives
Sort
View
CORR
2010
Springer
236views Education» more  CORR 2010»
14 years 10 months ago
Precise, Scalable and Online Request Tracing for Multi-tier Services of Black Boxes
As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administr...
Bo Sang, Jianfeng Zhan, Zhihong Zhang, Lei Wang, D...
SIAMADS
2010
121views more  SIAMADS 2010»
14 years 10 months ago
Binocular Rivalry in a Competitive Neural Network with Synaptic Depression
We study binocular rivalry in a competitive neural network with synaptic depression. In particular, we consider two coupled hypercolums within primary visual cortex (V1), represent...
Zachary P. Kilpatrick, Paul C. Bressloff
144
Voted
WWW
2006
ACM
16 years 4 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
CISS
2008
IEEE
15 years 10 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 8 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...