142 search results - page 6 / 29 » Computing Maximum-Scoring Segments in Almost Linear Time |
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
DAC
2010
ACM
13 years 7 months ago
2010
ACM
We study diagnosis of segments on speedpaths that fail the timing constraint at the post-silicon stage due to manufacturing variations. We propose a formal procedure that is appli...
CSDA
2007
13 years 7 months ago
2007
A common problem in linear regression is that largely aberrant values can strongly influence the results. The least quartile difference (LQD) regression estimator is highly robus...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
We present a new arrangement of directory bits called the segment directory to improve directory storage efficiency: a segment directory can point to several sharing processors wi...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Linear Feedback Shift Registers (LFSRs) have always received considerable attention in computer science especially in coding theory and in cryptography. The scope of applications ...