Sciweavers

2715 search results - page 136 / 543
» Total Generalized Variation
Sort
View
ESA
2005
Springer
105views Algorithms» more  ESA 2005»
15 years 8 months ago
Matching Point Sets with Respect to the Earth Mover's Distance
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
Sergio Cabello, Panos Giannopoulos, Christian Knau...
ICCSA
2005
Springer
15 years 8 months ago
Improved Location Management Scheme Based on Autoconfigured Logical Topology in HMIPv6
Abstract. Though some studies involving general micro-mobility exist, micromobility research concerning a mobile node (MN) moving between Mobile Anchor Points (MAP) is lacking. In ...
Jongpil Jeong, Hyunsang Youn, Hyunseung Choo, Euns...
ISLPED
2003
ACM
142views Hardware» more  ISLPED 2003»
15 years 8 months ago
Minimization of dynamic and static power through joint assignment of threshold voltages and sizing optimization
We describe an optimization strategy for minimizing total power consumption using dual threshold voltage (Vth) technology. Significant power savings are possible by simultaneous a...
David Nguyen, Abhijit Davare, Michael Orshansky, D...
ICASSP
2009
IEEE
15 years 7 months ago
GTD-based transceivers for decision feedback and bit loading
We consider new optimization problems for transceivers with DFE receivers and linear precoders, which also use bit loading at the transmitter. First, we consider the MIMO QoS (qual...
Ching-Chih Weng, Chun-Yang Chen, P. P. Vaidyanatha...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa