Sciweavers

3495 search results - page 122 / 699
» On the random satisfiable process
Sort
View
ICCV
2009
IEEE
15 years 1 months ago
Exploiting uncertainty in random sample consensus
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
15 years 9 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
15 years 9 months ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
AIPR
2004
IEEE
15 years 8 months ago
An Image Retrieval System Using Multispectral Random Field Models, Color, and Geometric Features
This paper describes a novel color texture-based image retrieval system for the query of an image database to find similar images to a target image. The retrieval process involves...
Orlando J. Hernandez, Alireza Khotanzad
152
Voted
FTDCS
2004
IEEE
15 years 7 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller