Sciweavers

269 search results - page 22 / 54
» random 2001
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 11 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
WABI
2001
Springer
14 years 2 months ago
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
We study the convergence rates of neighbor-joining and several new phylogenetic reconstruction methods on families of trees of bounded diameter. Our study presents theoretically ob...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
EMMCVPR
2001
Springer
14 years 2 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
CRYPTO
2001
Springer
136views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Session-Key Generation Using Human Passwords Only
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
Oded Goldreich, Yehuda Lindell
SIGIR
2008
ACM
13 years 9 months ago
Multi-document summarization using cluster-based link analysis
The Markov Random Walk model has been recently exploited for multi-document summarization by making use of the link relationships between sentences in the document set, under the ...
Xiaojun Wan, Jianwu Yang