879 search results - page 36 / 176 » Designing Closer to the Edge |
ITICSE
2004
ACM
14 years 3 months ago
2004
ACM
Web technologies have become essential in the computing curricula. However, teaching a Web development course to computing students is challenging because of large bodies of knowl...
DISOPT
2008
13 years 10 months ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
BMVC
2010
13 years 8 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
DAC
1994
ACM
14 years 2 months ago
1994
ACM
Abstract - We propose a new algorithm for the performancedriven interconnect design problem, based on alphabetic trees. The interconnect topology is determined in a global manner a...
JCT
2006
13 years 10 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....