Sciweavers

492 search results - page 59 / 99
» Fast data stream algorithms using associative memories
Sort
View
WWW
2007
ACM
14 years 8 months ago
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Click fraud is jeopardizing the industry of Internet advertising. Internet advertising is crucial for the thriving of the entire Internet, since it allows producers to advertise t...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
JVCA
2006
140views more  JVCA 2006»
13 years 7 months ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni
ICML
2003
IEEE
14 years 8 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
13 years 11 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
JOC
2008
92views more  JOC 2008»
13 years 7 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay