239 search results - page 18 / 48 » Hardness and algorithms for rainbow connection |
103
Voted
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
110
click to vote
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
109
click to vote
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
107
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...