1525 search results - page 103 / 305 » Matching with Regular Constraints |
113
click to vote
SAS
1999
Springer
15 years 8 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
148
click to vote
PAMI
2011
14 years 11 months ago
2011
—Optical flow estimation is classically marked by the requirement of dense sampling in time. While coarse-to-fine warping schemes have somehow relaxed this constraint, there is...
171
Voted
ICSOC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case tha...
124
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
109
Voted
SG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper introduces a semantic representation for virtual prototyping in interactive virtual construction applications. The representation reflects semantic information...