860 search results - page 139 / 172 » Lower Bounds on the Size of Test Data Sets |
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
A reliable method to evaluate and follow the course of arthritis is given by examination of the carpal bones within the wrist joint. Humans typically have eight such small angular...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
DAC
2009
ACM
14 years 11 days ago
2009
ACM
Process scaling has given designers billions of transistors to work with. As feature sizes near the atomic scale, extensive variation and wearout inevitably make margining unecono...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...