Sciweavers

681 search results - page 48 / 137
» Searching with expectations
Sort
View
ASIACRYPT
2006
Springer
15 years 3 months ago
Finding SHA-1 Characteristics: General Results and Applications
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we...
Christophe De Cannière, Christian Rechberge...
CPC
2002
80views more  CPC 2002»
14 years 11 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
WAPCV
2004
Springer
15 years 5 months ago
Distributed Control of Attention
Detection of objects is in general a computationally demanding task. To simplify the problem it is of interest to focus the attention to a set of regions of interest. Indoor enviro...
Ola Ramström, Henrik I. Christensen
ICRA
2007
IEEE
144views Robotics» more  ICRA 2007»
15 years 6 months ago
Particle RRT for Path Planning with Uncertainty
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
Nik A. Melchior, Reid G. Simmons
ISMB
2000
15 years 1 months ago
A Statistical Method for Finding Transcription Factor Binding Sites
Understanding the mechanismsthat determine the regulation of geneexpression is an important and challenging problem. A fundamental subproblem is to identify DNA-bindingsites for u...
Saurabh Sinha, Martin Tompa