Sciweavers

620 search results - page 69 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
TVCG
2008
128views more  TVCG 2008»
14 years 11 months ago
AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
Anish Chandak, Christian Lauterbach, Micah T. Tayl...
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
15 years 9 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 3 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 3 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay
TIP
2008
128views more  TIP 2008»
14 years 11 months ago
Wavelet Frame Accelerated Reduced Support Vector Machines
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
Matthias Rätsch, Gerd Teschke, Sami Romdhani,...