Sciweavers

712 search results - page 85 / 143
» A mixture model for random graphs
Sort
View
COMSWARE
2007
IEEE
14 years 2 months ago
Analysis of Dynamic Sensor Networks: Power Law Then What?
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...
Eric Fleury, Jean-Loup Guillaume, Céline Ro...
ICML
2004
IEEE
14 years 1 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
COR
2006
94views more  COR 2006»
13 years 7 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
SAC
2002
ACM
13 years 7 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...