Sciweavers

200 search results - page 14 / 40
» What Graphs can be Efficiently Represented by BDDs
Sort
View

Publication
203views
13 years 7 months ago
Multigraph Sampling of Online Social Networks
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
Minas Gjoka, Carter T. Butts, Maciej Kurant, Athin...
CLIMA
2010
13 years 9 months ago
Exploring the Boundary of Half Positionality
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such proble...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...
BIRTHDAY
2010
Springer
13 years 7 months ago
Change Management for Heterogeneous Development Graphs
Abstract. The error-prone process of formal specification and verification of large systems requires an efficient, evolutionary formal development approach. Development graphs have...
Serge Autexier, Dieter Hutter, Till Mossakowski
ICSE
2004
IEEE-ACM
14 years 7 months ago
Efficient Decentralized Monitoring of Safety in Distributed Systems
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is ba...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu
ICPR
2010
IEEE
13 years 5 months ago
Learning Scene Semantics Using Fiedler Embedding
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst can efficiently and effectively retrieve the hidden sem...
Jingen Liu, Saad Ali