Sciweavers

14779 search results - page 10 / 2956
» On Ultrametric Algorithmic Information
Sort
View
ICUMT
2009
13 years 6 months ago
Epidemic information diffusion in realistic vehicular network mobility scenarios
Epidemic or gossip-based algorithms have been proposed for data dissemination in vehicular networks. Due to the unfeasibility of deploying large size vehicular networks, the perfor...
Claudia Barberis, Giovanni Malnati
CEC
2010
IEEE
13 years 2 days ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
IFIP12
2009
13 years 6 months ago
Revealing Paths of Relevant Information in Web Graphs
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
Georgios Kouzas, Vassilis Kolias, Ioannis Anagnost...
EUROCRYPT
2012
Springer
11 years 11 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 11 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon