Sciweavers

2040 search results - page 331 / 408
» Approximate Expectation Maximization
Sort
View
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 6 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
FSTTCS
2000
Springer
15 years 6 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
WSC
2008
15 years 5 months ago
Priority mix planning for cycle time-differentiated semiconductor manufacturing services
Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. Th...
Shi-Chung Chang, Shin-Shyu Su, Ke-Ju Chen
DGCI
2008
Springer
15 years 5 months ago
Statistical Template Matching under Geometric Transformations
Abstract. We present a novel template matching framework for detecting geometrically transformed objects. A template is a simplified representation of the object of interest by a s...
Alexander Sibiryakov
150
Voted
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 5 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin