122 search results - page 21 / 25 » Reducing the Storage Requirements of a Perfect Hash Function |
CIDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
SPIRE
2009
Springer
14 years 1 months ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ...
CGA
2005
13 years 7 months ago
2005
Procedural encoding of scattered and unstructured scalar datasets using Radial Basis Functions (RBF) is an active area of research with great potential for compactly representing ...
AAAI
2010
13 years 8 months ago
2010
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...