Sciweavers

5153 search results - page 772 / 1031
» Introduction to Randomized Algorithms
Sort
View
WEBI
2009
Springer
16 years 1 months ago
Rigorous Probabilistic Trust-Inference with Applications to Clustering
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
150
Voted
CAIP
2009
Springer
165views Image Analysis» more  CAIP 2009»
16 years 1 months ago
Texture Editing Using Frequency Swap Strategy
A fully automatic colour texture editing method is proposed, which allows to synthesise and enlarge an artificial texture sharing anticipated properties from its parent textures. ...
Michal Haindl, Vojtech Havlícek
COMPLEX
2009
Springer
16 years 1 months ago
Epidemic Self-synchronization in Complex Networks
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
Ingo Scholtes, Jean Botev, Markus Esch, Peter Stur...
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
16 years 1 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 1 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...