1809 search results - page 53 / 362 » Weakly Computable Real Numbers |
175
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
196
click to vote
ICDCS
1995
IEEE
15 years 9 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
156
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches b...
148
click to vote
AIIDE
2008
15 years 8 months ago
2008
Bots for Real Time Strategy (RTS) games are challenging to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while at the s...
166
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...