1200 search results - page 169 / 240 » Marked Ancestor Problems |
148
click to vote
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
131
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
Future high-end computers will offer great performance improvements over today’s machines, enabling applications of far greater complexity. However, designers must solve the cha...
150
Voted
WCRE
2002
IEEE
15 years 10 months ago
2002
IEEE
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
119
Voted
ICSE
2010
IEEE-ACM
15 years 9 months ago
2010
IEEE-ACM
A fundamental problem of finding applications that are highly relevant to development tasks is the mismatch between the high-level intent reflected in the descriptions of these ...
149
click to vote
SIGGRAPH
2010
ACM
15 years 9 months ago
2010
ACM
This paper addresses the fundamental problem of computing stable medial representations of 3D shapes. We propose a spatially adaptive classification of geometric features that yi...