Sciweavers

150 search results - page 18 / 30
» Fast Unimodular Counting
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
CVPR
2003
IEEE
14 years 9 months ago
Finding and Tracking People from the Bottom Up
We describe a tracker that can track moving people in long sequences without manual initialization. Moving people are modeled with the assumption that, while configuration can var...
Deva Ramanan, David A. Forsyth
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 1 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
ASPDAC
2008
ACM
108views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Synthesis and design of parameter extractors for low-power pre-computation-based content-addressable memory using gate-block sel
Content addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due t...
Jui-Yuan Hsieh, Shanq-Jang Ruan
JMMA
2010
90views more  JMMA 2010»
13 years 2 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke