2693 search results - page 392 / 539 » On Computing Complex Navigation Functions |
229
click to vote
STACS
2012
Springer
14 years 1 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
263
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
162
click to vote
ACIVS
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Feature subset selection is an important subject when training classifiers in Machine Learning (ML) problems. Too many input features in a ML problem may lead to the so-...
155
click to vote
ICDM
2005
IEEE
15 years 12 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
143
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...