Sciweavers

6894 search results - page 375 / 1379
» Generation Problems
Sort
View
SIGGRAPH
1999
ACM
15 years 11 months ago
Direct Illumination with Lazy Visibility Evaluation
In this paper we present a technique for computing the direct lighting in a three-dimensional scene containing area light sources. Our method correctly handles partial visibility ...
David Hart, Philip Dutré, Donald P. Greenbe...
HYBRID
2009
Springer
16 years 1 months ago
Optimization of Multi-agent Motion Programs with Applications to Robotic Marionettes
Abstract. In this paper, we consider the problem of generating optimized, executable control code from high-level, symbolic specifications. In particular, we construct symbolic co...
Patrick Martin, Magnus Egerstedt
IJCAI
2003
15 years 8 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
164
Voted
TRIDENTCOM
2006
IEEE
16 years 25 days ago
Light-trail testbed for metro optical networks
— Telecommunication networks have rapidly added staggering amounts of capacity to their long haul networks at low costs per bit using DWDM technologies. Concurrently, there has b...
Nathan A. VanderHorn, Srivatsan Balasubramanian, M...
CVPR
2010
IEEE
15 years 8 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...