1887 search results - page 242 / 378 » An efficient search algorithm for partially ordered sets |
ICDM
2009
IEEE
13 years 7 months ago
2009
IEEE
Given a set of moving object trajectories, it is of interest to find a group of objects, called a convoy, that are spatially density-connected for a certain duration of time. Howev...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
VMV
2001
13 years 10 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
JCST
2007
13 years 9 months ago
2007
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 ...
AND
2009
13 years 7 months ago
2009
In this paper, we propose an alternative method for accessing the content of Greek historical documents printed during the 17th and 18th centuries by searching words directly in d...