Sciweavers

2899 search results - page 569 / 580
» Dynamic Trees in Practice
Sort
View
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 10 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
LFP
1992
140views more  LFP 1992»
13 years 10 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
CONEXT
2009
ACM
13 years 9 months ago
BUFFALO: bloom filter forwarding architecture for large organizations
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
Minlan Yu, Alex Fabrikant, Jennifer Rexford
CVPR
2010
IEEE
13 years 9 months ago
High performance object detection by collaborative learning of Joint Ranking of Granules features
Object detection remains an important but challenging task in computer vision. We present a method that combines high accuracy with high efficiency. We adopt simplified forms of...
Chang Huang, Ramakant Nevatia
SIGCOMM
2010
ACM
13 years 9 months ago
Contrabass: concurrent transmissions without coordination
A PHY and MAC protocol for MIMO concurrent transmissions, called Contrabass, is presented. Concurrent transmissions, also referred to as multi-user MIMO, are simultaneous transmis...
Sungro Yoon