11 search results - page 2 / 3 » A framework for unrestricted whole-program optimization |
CVPR
2009
IEEE
15 years 6 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
SIGECOM
2006
ACM
14 years 4 months ago
2006
ACM
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
CODES
2005
IEEE
14 years 4 months ago
2005
IEEE
Arbitrary memory dependencies and variable latency memory systems are major obstacles to the synthesis of large-scale ASIC systems in high-level synthesis. This paper presents SOM...
AAAI
2007
14 years 1 months ago
2007
We present a novel Text-to-Picture system that synthesizes a picture from general, unrestricted natural language text. The process is analogous to Text-to-Speech synthesis, but wi...
IJCV
2006
13 years 11 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...