1158 search results - page 106 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
275
click to vote
VLDB
2006
ACM
16 years 6 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
179
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
268
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
161
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
185
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...