425 search results - page 16 / 85 » Polynomial Time Data Reduction for Dominating Set |
125
click to vote
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
COCO
1995
Springer
15 years 1 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
VLSID
2000
IEEE
15 years 1 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
MDM
2004
Springer
15 years 2 months ago
2004
Springer
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
AUSAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...