4039 search results - page 214 / 808 » A Method for Dynamic Clustering of Data |
179
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
150
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Biological information is commonly used to cluster or classify entities of interest such as genes, conditions, species or samples. However, different sources of data c...
162
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
183
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
156
click to vote
FPGA
1995
ACM
15 years 9 months ago
1995
ACM
This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the to...