Sciweavers

14739 search results - page 2854 / 2948
» An optimization problem on the sphere
Sort
View
CIKM
2009
Springer
15 years 4 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
CIKM
2009
Springer
15 years 4 months ago
Semi-nonnegative matrix factorization with global statistical consistency for collaborative filtering
Collaborative Filtering, considered by many researchers as the most important technique for information filtering, has been extensively studied by both academic and industrial co...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
FC
2009
Springer
134views Cryptology» more  FC 2009»
15 years 4 months ago
Cryptographic Combinatorial Securities Exchanges
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Christopher Thorpe, David C. Parkes
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 4 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 4 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
« Prev « First page 2854 / 2948 Last » Next »