Sciweavers

2638 search results - page 374 / 528
» Random Geometric Complexes
Sort
View
CANDC
2002
ACM
15 years 2 months ago
Computer aided creativity: practical experience and theoretical concerns
In this paper I will outline some of the practical experiences and theoretical concerns that have informed some 15 years of research into the relationship between human creativity...
Robert Pepperell
ECCC
2000
113views more  ECCC 2000»
15 years 2 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
125
Voted
ET
2000
145views more  ET 2000»
15 years 2 months ago
Fast Test Pattern Generation for Sequential Circuits Using Decision Diagram Representations
The paper presents a novel hierarchical approach to test pattern generation for sequential circuits based on an input model of mixed-level decision diagrams. A method that handles,...
Jaan Raik, Raimund Ubar
PPSN
2010
Springer
15 years 26 days ago
Globally Induced Model Trees: An Evolutionary Approach
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
Marcin Czajkowski, Marek Kretowski
RSA
2010
104views more  RSA 2010»
15 years 26 days ago
An approximation algorithm for counting contingency tables
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
Alexander I. Barvinok, Zur Luria, Alex Samorodnits...