Sciweavers

74 search results - page 9 / 15
» Enumerating randoms
Sort
View
AML
2011
177views Mathematics» more  AML 2011»
13 years 4 months ago
A superhigh diamond in the c.e. tt-degrees
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu ...
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
PVLDB
2010
200views more  PVLDB 2010»
13 years 8 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 9 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
13 years 9 months ago
Directed Animals and Gas Models Revisited
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert