Sciweavers

4541 search results - page 866 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 3 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
ANCS
2006
ACM
15 years 2 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...
AUSAI
2008
Springer
15 years 1 months ago
Character Recognition Using Hierarchical Vector Quantization and Temporal Pooling
In recent years, there has been a cross-fertilization of ideas between computational neuroscience models of the operation of the neocortex and artificial intelligence models of mac...
John Thornton, Jolon Faichney, Michael Blumenstein...
101
Voted
JCDL
2010
ACM
187views Education» more  JCDL 2010»
15 years 1 months ago
Social network document ranking
In search engines, ranking algorithms measure the importance and relevance of documents mainly based on the contents and relationships between documents. User attributes are usual...
Liang Gou, Xiaolong Zhang, Hung-Hsuan Chen, Jung-H...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 19 days ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...