4850 search results - page 210 / 970 » Proof and Computation in Geometry |
149
click to vote
GD
2007
Springer
16 years 22 days ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
182
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
151
click to vote
ICIP
2007
IEEE
16 years 26 days ago
2007
IEEE
The ability to quickly compute hand geometry measurements from a freely posed hand offers advantages to biometric identification systems. While hand geometry systems are not new,...
179
click to vote
ICCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The complexity of virtual environments has grown spectacularly over the recent years, mainly thanks to the use of the currently cheap high performance graphics cards. As ...
190
click to vote
JCP
2007
15 years 6 months ago
2007
—One of the challenging problems in geometric modeling and computer graphics is the construction of realistic human facial geometry. Such geometry are essential for a wide range ...