52 search results - page 4 / 11 » Finding the maximum and minimum elements with one lie |
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which a...
122
click to vote
IPCO
2001
14 years 11 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
69
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
71
Voted
IDA
2009
Springer
15 years 4 months ago
2009
Springer
Underdetermined source separation is often carried out by modeling time-frequency source coefficients via a fixed sparse prior. This approach fails when the number of active sourc...