329 search results - page 29 / 66 » On Range Searching with Semialgebraic Sets |
COMPGEOM
2007
ACM
14 years 17 days ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
CSIE
2009
IEEE
14 years 3 months ago
2009
IEEE
Topographic maps are an appealing exploratory instrument for discovering new knowledge from databases. During the past years, new types of Self Organizing Maps (SOM) were introduc...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
We investigates language models for informational and navigational web search. Retrieval on the web is a task that differs substantially from ordinary ad hoc retrieval. We perfor...
JCST
2007
13 years 8 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 ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...