3946 search results - page 298 / 790 » The computational complexity of choice sets |
158
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
150
click to vote
ICPADS
2008
IEEE
16 years 1 months ago
2008
IEEE
Peer-to-Peer systems have become a substantial element in computer networking. Distributing the load and splitting complex tasks are only some reasons why many developers have com...
188
click to vote
HUC
2005
Springer
16 years 9 days ago
2005
Springer
When computation moves off the desktop, how will it transform the new spaces that it comes to occupy? How will people encounter and understand these spaces, and how will they inter...
190
click to vote
ACPC
1999
Springer
15 years 11 months ago
1999
Springer
For lighting simulations in architecture there is the need for correct illumination calculation of virtual scenes. The Radiance Synthetic Imaging System delivers an excellent solut...
180
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...