Sciweavers

274 search results - page 29 / 55
» Identifying sets of key players in a social network
Sort
View
KAIS
2010
139views more  KAIS 2010»
13 years 7 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
INFOCOM
2000
IEEE
14 years 2 days ago
Peering and Provisioning of Differentiated Internet Services
A key consideration in building differentiated network services is the feasibility of maintaining stable and consistent service level agreements across multiple networks where allo...
Nemo Semret, Raymond R.-F. Liao, Andrew T. Campbel...
BMCBI
2004
207views more  BMCBI 2004»
13 years 8 months ago
Computational identification of transcription factor binding sites by functional analysis of sets of genes sharing overrep-resen
Background: Transcriptional regulation is a key mechanism in the functioning of the cell, and is mostly effected through transcription factors binding to specific recognition moti...
Davide Corà, Ferdinando Di Cunto, Paolo Pro...
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 25 days ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
MP
2006
110views more  MP 2006»
13 years 8 months ago
Robust game theory
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
Michele Aghassi, Dimitris Bertsimas