Sciweavers

708 search results - page 48 / 142
» Timing closure: the solution and its problems
Sort
View
FOCS
2004
IEEE
15 years 1 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
SWAT
1994
Springer
94views Algorithms» more  SWAT 1994»
15 years 2 months ago
On Self-Stabilizing Wait-Free Clock Synchronization
Protocols which can tolerate any number of processors failing by ceasing operation for an unbounded number of steps and resuming operation (with or) without knowing that they were...
Marina Papatriantafilou, Philippas Tsigas
TSP
2008
122views more  TSP 2008»
14 years 10 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
ECCV
2010
Springer
15 years 3 months ago
Energy Minimization Under Constraints on Label Counts
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
IPPS
2000
IEEE
15 years 2 months ago
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
Zhiquan Frank Qiu, Mi Lu