1736 search results - page 130 / 348 » On antimagic directed graphs |
179
click to vote
INFOCOM
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
176
click to vote
IJCNN
2007
IEEE
16 years 25 days ago
2007
IEEE
— The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...
258
click to vote
BVAI
2007
Springer
16 years 21 days ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
168
click to vote
SSS
2007
Springer
16 years 19 days ago
2007
Springer
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...
177
click to vote
ICDM
2006
IEEE
16 years 17 days ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...