2107 search results - page 300 / 422 » Computing Small Search Numbers in Linear Time |
137
click to vote
DAC
1989
ACM
15 years 6 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 ...
140
Voted
ICPR
2000
IEEE
15 years 6 months 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...
145
Voted
CONSTRAINTS
2011
14 years 6 months 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...
124
click to vote
TAMC
2007
Springer
15 years 8 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 ...
126
Voted
CVPR
2008
IEEE
16 years 4 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...