Sciweavers

2286 search results - page 395 / 458
» Algorithms for Categorical Equivalence
Sort
View
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
15 years 6 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
ARSCOM
1998
104views more  ARSCOM 1998»
15 years 6 months ago
A Note on the Road-Coloring Conjecture
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
E. Gocka, Walter W. Kirchherr, Edward F. Schmeiche...
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Tractability of Theory Patching
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
Shlomo Argamon-Engelson, Moshe Koppel
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
15 years 6 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
JMLR
2002
102views more  JMLR 2002»
15 years 6 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering