Sciweavers

5184 search results - page 13 / 1037
» The digital divide of computing
Sort
View
DAC
1996
ACM
15 years 3 months ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant
RSS
2007
128views Robotics» more  RSS 2007»
15 years 26 days ago
Data Association in O(n) for Divide and Conquer SLAM
—In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divid...
Lina María Paz, José E. Guivant, Jua...
CVPR
2004
IEEE
16 years 1 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
CONEXT
2008
ACM
15 years 1 months ago
Uplink allocation beyond choke/unchoke: or how to divide and conquer best
Motivated by emerging cooperative P2P applications we study new uplink allocation algorithms for substituting the ratebased choke/unchoke algorithm of BitTorrent which was develop...
Nikolaos Laoutaris, Damiano Carra, Pietro Michiard...
139
Voted
ANCS
2009
ACM
14 years 9 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...