Sciweavers

400 search results - page 68 / 80
» Extended formulations in combinatorial optimization
Sort
View
ICML
2008
IEEE
14 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
CISS
2008
IEEE
14 years 1 months ago
A genetic algorithm for designing constellations with low error floors
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
Matthew C. Valenti, Raghu Doppalapudi, Don J. Torr...
ICARCV
2008
IEEE
199views Robotics» more  ICARCV 2008»
14 years 1 months ago
Error propagation suppression in Self-servo Track Writer by time-domain control design
—Control design of Self-servo Track Writer (SSTW) has become an important issue in Hard Disk Drive research. This paper discusses the error propagation problem in SSTW control. A...
Sehoon Oh, Yoichi Hori
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
14 years 25 days ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
ICMCS
2006
IEEE
167views Multimedia» more  ICMCS 2006»
14 years 23 days ago
Efficient Object Tracking using Control-Based Observer Design
Kernel-based tracking approaches have proven to be more efficient in computation compared to other tracking approaches such as particle filtering. However, existing kernel-based...
Wei Qu, Dan Schonfeld