Sciweavers

724 search results - page 89 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
GLOBECOM
2010
IEEE
14 years 10 months ago
Learning Interference Strategies in Cognitive ARQ Networks
Cognitive radios, which enable the coexistence on the same bandwidth of licensed primary and unlicensed secondary users, have the potential for dramatically increasing the efficien...
Sina Firouzabadi, Marco Levorato, Daniel O'Neill, ...
SIGCOMM
2006
ACM
15 years 5 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
VISUALIZATION
1999
IEEE
15 years 4 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 1 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
CVPR
2006
IEEE
16 years 1 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson