3192 search results - page 502 / 639 » The minimum latency problem |
116
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
101
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
113
click to vote
RECOMB
2008
Springer
16 years 1 months ago
2008
Springer
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...
120
click to vote
SIGMOD
2003
ACM
16 years 28 days ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
106
Voted
EWSN
2008
Springer
16 years 11 days ago
2008
Springer
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...