2107 search results - page 300 / 422 » Computing Small Search Numbers in Linear Time |
DAC
1989
ACM
14 years 1 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
ICPR
2000
IEEE
14 years 21 days ago
2000
IEEE
Methods for controlling the adaptation process of an on-line handwritten character recognizer are studied. The classifier is based on the -nearest neighbor rule and it is adapted...
CONSTRAINTS
2011
13 years 20 days ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
The use of 3-D ultrasound data has several advantages over 2-D ultrasound for fetal biometric measurements, such as considerable decrease in the examination time, possibility of p...