Sciweavers

804 search results - page 56 / 161
» The Need for Speed
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 8 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
CN
1999
114views more  CN 1999»
13 years 8 months ago
An Improved Topology Discovery Algorithm for Networks with Wormhole Routing and Directed Links
We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing. An algorithm of this type was develop...
Ying-Yi Huang, Mart L. Molle
DEXA
2009
Springer
222views Database» more  DEXA 2009»
14 years 3 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos
CVPR
2008
IEEE
14 years 10 months ago
Efficient mean shift belief propagation for vision tracking
A mechanism for efficient mean-shift belief propagation (MSBP) is introduced. The novelty of our work is to use mean-shift to perform nonparametric mode-seeking on belief surfaces...
Minwoo Park, Yanxi Liu, Robert T. Collins
OSDI
2004
ACM
14 years 9 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...