Sciweavers

793 search results - page 138 / 159
» Efficient computation of the characteristic polynomial
Sort
View
IR
2006
13 years 8 months ago
Full-text federated search of text-based digital libraries in peer-to-peer networks
Abstract. Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalabl...
Jie Lu, Jamie Callan
JMM2
2008
124views more  JMM2 2008»
13 years 8 months ago
Integrated Feature Selection and Clustering for Taxonomic Problems within Fish Species Complexes
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
Huimin Chen, Henry L. Bart Jr., Shuqing Huang
JUCS
2008
138views more  JUCS 2008»
13 years 8 months ago
A Knowledge Discovery Agent for a Topology Bit-map in Ad Hoc Mobile Networks
: A central characteristic of ad hoc mobile networks is the frequent changes of their topology. This is the source of many problems that need to be solved. AODV is an on-demand rou...
SungSoo Lee, HangKon Kim, ChongGun Kim
PAMI
2008
270views more  PAMI 2008»
13 years 8 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
JCST
2007
97views more  JCST 2007»
13 years 8 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