Sciweavers

821 search results - page 59 / 165
» Addressing the Petersen graph
Sort
View
ICML
2004
IEEE
16 years 4 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
CONEXT
2009
ACM
15 years 5 months ago
Exploiting dynamicity in graph-based traffic analysis: techniques and applications
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...
WWW
2004
ACM
16 years 4 months ago
Semantic api matching for automatic service composition
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...
Doina Caragea, Tanveer Fathima Syeda-Mahmood
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
15 years 10 months ago
On time-scale designs for networks
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
Sandip Roy, Yan Wan, Ali Saberi
ECRTS
2007
IEEE
15 years 10 months ago
Predictable Paging in Real-Time Systems: A Compiler Approach
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
Isabelle Puaut, Damien Hardy