Sciweavers

514 search results - page 103 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
CIE
2010
Springer
13 years 8 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
DICTA
2003
13 years 6 months ago
Algebraic Curve Fitting Support Vector Machines
An algebraic curve is defined as the zero set of a multivariate polynomial. We consider the problem of fitting an algebraic curve to a set of vectors given an additional set of v...
Christian J. Walder, Brian C. Lovell, Peter J. Koo...
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 4 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
KDD
2012
ACM
222views Data Mining» more  KDD 2012»
11 years 7 months ago
Rise and fall patterns of information diffusion: model and implications
The recent explosion in the adoption of search engines and new media such as blogs and Twitter have facilitated faster propagation of news and rumors. How quickly does a piece of ...
Yasuko Matsubara, Yasushi Sakurai, B. Aditya Praka...