3299 search results - page 203 / 660 » A general mathematics of names |
154
click to vote
DGCI
2000
Springer
15 years 11 months ago
2000
Springer
A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is...
149
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
148
click to vote
ANSS
1998
IEEE
15 years 10 months ago
1998
IEEE
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...
148
click to vote
SIGCSE
1997
ACM
15 years 10 months ago
1997
ACM
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
200
click to vote
ESA
1994
Springer
15 years 10 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...