2370 search results - page 123 / 474 » The Characterization of Data-Accumulating Algorithms |
DCG
1998
14 years 9 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
105
click to vote
SIAMDM
2010
14 years 4 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Current CMOS technologies are characterized by interconnect lines with increased relative resistance w.r.t. driver output resistance. Designs generate signal waveshapes that are v...
IBPRIA
2007
Springer
15 years 4 months ago
2007
Springer
Carotid atherosclerosis is the most common life-threatening neurological disease and therefore an accurate assessment of atheromatous plaques is clinically important. Several studi...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...