Sciweavers

219 search results - page 24 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
JCST
2007
97views more  JCST 2007»
13 years 7 months ago
Improved Collision Attack on Hash Function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
Jie Liang, Xue-Jia Lai
CGF
2010
218views more  CGF 2010»
13 years 7 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
IROS
2009
IEEE
165views Robotics» more  IROS 2009»
14 years 2 months ago
Autonomous altitude estimation of a UAV using a single onboard camera
Abstract— Autonomous estimation of the altitude of an Unmanned Aerial Vehicle (UAV) is extremely important when dealing with flight maneuvers like landing, steady flight, etc. ...
Anoop Cherian, Jonathan Andersh, Vassilios Morella...
FUIN
2008
112views more  FUIN 2008»
13 years 7 months ago
A New Probabilistic Approach for Fractal Based Image Compression
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 8 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher