Sciweavers

2585 search results - page 298 / 517
» computing 1999
Sort
View
ICS
1999
Tsinghua U.
15 years 8 months ago
Mechanisms and policies for supporting fine-grained cycle stealing
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...
Kyung Dong Ryu, Jeffrey K. Hollingsworth, Peter J....
ICML
1999
IEEE
16 years 5 months ago
AdaCost: Misclassification Cost-Sensitive Boosting
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang, Philip...
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
15 years 8 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
CHI
1999
ACM
15 years 8 months ago
TouchCounters: Designing Interactive Electronic Labels for Physical Containers
We present TouchCounters, an integrated system of electronic modules, physical storage containers, and shelving surfaces for the support of collaborative physical work. Through ph...
Paul Yarin, Hiroshi Ishii
FOCS
1999
IEEE
15 years 8 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk