Sciweavers

1232 search results - page 161 / 247
» Digraphs: theory, algorithms and applications
Sort
View
ICFP
2008
ACM
14 years 9 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
WWW
2010
ACM
14 years 4 months ago
Find me if you can: improving geographical prediction with social and spatial proximity
Geography and social relationships are inextricably intertwined; the people we interact with on a daily basis almost always live near us. As people spend more time online, data re...
Lars Backstrom, Eric Sun, Cameron Marlow
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
14 years 4 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule
FOCS
2009
IEEE
14 years 3 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
LICS
2009
IEEE
14 years 3 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux