Sciweavers

2376 search results - page 244 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 8 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
RECOMB
2008
Springer
14 years 8 months ago
Locating Multiple Gene Duplications through Reconciled Trees
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...
J. Gordon Burleigh, Mukul S. Bansal, André ...
RECOMB
2006
Springer
14 years 8 months ago
Identification and Evaluation of Functional Modules in Gene Co-expression Networks
Abstract. Identifying gene functional modules is an important step towards elucidating gene functions at a global scale. In this paper, we introduce a simple method to construct ge...
Jianhua Ruan, Weixiong Zhang
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 8 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 8 months ago
A geometric approach to monitoring threshold functions over distributed data streams
Monitoring data streams in a distributed system is the focus of much research in recent years. Most of the proposed schemes, however, deal with monitoring simple aggregated values...
Izchak Sharfman, Assaf Schuster, Daniel Keren