2911 search results - page 461 / 583 » A Logic of Graph Constraints |
82
Voted
MICRO
2006
IEEE
15 years 6 months ago
2006
IEEE
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...
108
Voted
DATE
2005
IEEE
15 years 6 months ago
2005
IEEE
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...
84
Voted
SAC
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
123
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
123
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Since most current scene understanding approaches operate
either on the 2D image or using a surface-based representation, they do
not allow reasoning about the physical constrain...