Sciweavers

1307 search results - page 102 / 262
» Follow the intellectual property
Sort
View
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
15 years 3 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
IJCAI
2003
15 years 3 months ago
Predicting Web Information Content
In this paper, we propose a novel method to infer the web user’s Information Content (IC), which is the information that the user must examine to complete her task. In particula...
Tingshao Zhu, Russell Greiner, Gerald Häubl, ...
CORR
2010
Springer
63views Education» more  CORR 2010»
15 years 1 months ago
On Opinion Dynamics in Heterogeneous Networks
This paper studies the opinion dynamics model recently introduced by Hegselmann and Krause: (1) each agent in a group mantains a real number describing its opinion, (2) each agent ...
Anahita Mirtabatabaei, Francesco Bullo
ENDM
2008
142views more  ENDM 2008»
15 years 1 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 1 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...