Sciweavers

209 search results - page 29 / 42
» Decomposable Constraints
Sort
View
DAC
2006
ACM
14 years 8 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
ICML
2008
IEEE
14 years 8 months ago
Accurate max-margin training for structured output spaces
Tsochantaridis et al. (2005) proposed two formulations for maximum margin training of structured spaces: margin scaling and slack scaling. While margin scaling has been extensivel...
Sunita Sarawagi, Rahul Gupta
PERCOM
2009
ACM
14 years 2 months ago
A Dynamic Platform for Runtime Adaptation
—We present a middleware platform for assembling pervasive applications that demand fault-tolerance and adaptivity in distributed, dynamic environments. Unlike typical adaptive m...
Hubert Pham, Justin Mazzola Paluska, Umar Saif, Ch...
COCOA
2009
Springer
14 years 2 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu