3019 search results - page 216 / 604 » Approximating the Domatic Number |
209
click to vote
SPAA
1999
ACM
15 years 10 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
172
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
155
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
155
click to vote
SSDBM
2000
IEEE
15 years 10 months ago
2000
IEEE
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
267
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...