Sciweavers

837 search results - page 28 / 168
» Hard combinators
Sort
View
CP
2009
Springer
14 years 8 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
80
Voted
TVCG
2011
120views more  TVCG 2011»
14 years 5 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
CVPR
2011
IEEE
14 years 6 months ago
Action Recognition from a Distributed Representation of Pose and Appearance
We present a distributed representation of pose and appearance of people called the “poselet activation vector”. First we show that this representation can be used to estimate...
Subhransu Maji, Lubomir Bourdev, Jitendra Malik
68
Voted
ESSOS
2010
Springer
15 years 3 months ago
BuBBle: A Javascript Engine Level Countermeasure against Heap-Spraying Attacks
Web browsers that support a safe language such as Javascript are becoming a platform of great interest for security attacks. One such attack is a heap-spraying attack: a new kind o...
Francesco Gadaleta, Yves Younan, Wouter Joosen
123
Voted
DATE
2009
IEEE
163views Hardware» more  DATE 2009»
15 years 2 months ago
Analysis and optimization of fault-tolerant embedded systems with hardened processors
1 In this paper we propose an approach to the design optimization of fault-tolerant hard real-time embedded systems, which combines hardware and software fault tolerance techniques...
Viacheslav Izosimov, Ilia Polian, Paul Pop, Petru ...