Sciweavers

492 search results - page 61 / 99
» The number of possibilities for random dating
Sort
View
86
Voted
IAAI
2003
14 years 11 months ago
Guided Conversations about Leadership: Mentoring with Movies and Interactive Characters
Think Like a Commander – Excellence in Leadership (TLAC-XL) is an application designed for learning leadership skills both from the experiences of others and through a structure...
Randall W. Hill Jr., Jay Douglas, Andrew Gordon, F...
BMCBI
2008
138views more  BMCBI 2008»
14 years 10 months ago
Automated simultaneous analysis phylogenetics (ASAP): an enabling tool for phlyogenomics
Background: The availability of sequences from whole genomes to reconstruct the tree of life has the potential to enable the development of phylogenomic hypotheses in ways that ha...
Indra Neil Sarkar, Mary G. Egan, Gloria M. Coruzzi...
87
Voted
ISPA
2005
Springer
15 years 3 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
75
Voted
EUROCRYPT
2009
Springer
15 years 10 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...