19700 search results - page 3734 / 3940 » DNA-Based Computation Times |
128
click to vote
NIPS
2003
15 years 5 months ago
2003
Recent work has examined the estimation of models of stimulus-driven neural activity in which some linear filtering process is followed by a nonlinear, probabilistic spiking stag...
133
click to vote
AAAI
2000
15 years 5 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
154
Voted
SODA
2003
ACM
15 years 5 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
129
click to vote
BMVC
1998
15 years 5 months ago
1998
This paper presents an original method using colour histograms for flaw detection in automated industrial inspection. The colour histogram of an image is constructed by mapping th...
117
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...