114 search results - page 10 / 23 » An efficient condition for a graph to be Hamiltonian |
TKDE
2008
13 years 7 months ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
TCOM
2008
13 years 7 months ago
2008
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
EUROMICRO
1998
IEEE
13 years 11 months ago
1998
IEEE
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...