9842 search results - page 1296 / 1969 » The Complexity of the Matching-Cut Problem |
174
click to vote
3DIM
2003
IEEE
16 years 22 days ago
2003
IEEE
Highly realistic virtual human models are rapidly becoming commonplace in computer graphics. These models, often represented by complex shape and requiring labor-intensive process...
164
click to vote
DATE
2003
IEEE
2003
IEEE
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
16 years 22 days ago
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
158
click to vote
FOCS
2003
IEEE
16 years 22 days ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
192
click to vote
INFOCOM
2003
IEEE
16 years 22 days ago
2003
IEEE
—A mobile device in a MANET must be assigned a free IP address before it may participate in unicast communication. This is a fundamental and difficult problem in the practical us...
178
click to vote
INFOVIS
2003
IEEE
16 years 22 days ago
2003
IEEE
This paper reports on the development of a visualization system for architectural lighting designers. It starts by motivating the problem as both complex in its physics and social...