Sciweavers

567 search results - page 41 / 114
» Exact train pathing
Sort
View
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
14 years 12 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
INFOCOM
2011
IEEE
14 years 3 months ago
Analysis and algorithms for partial protection in mesh networks
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...
Greg Kuperman, Eytan Modiano, Aradhana Narula-Tam
ACL
2004
15 years 1 months ago
Optimizing Typed Feature Structure Grammar Parsing through Non-Statistical Indexing
This paper introduces an indexing method based on static analysis of grammar rules and type signatures for typed feature structure grammars (TFSGs). The static analysis tries to p...
Cosmin Munteanu, Gerald Penn
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
15 years 6 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
CIE
2009
Springer
15 years 6 months ago
Members of Random Closed Sets
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
David Diamondstone, Bjørn Kjos-Hanssen