728 search results - page 86 / 146 » Efficient Searching with Linear Constraints |
150
click to vote
TVCG
2010
15 years 4 months ago
2010
—Many visualization applications benefit from displaying content on real-world objects rather than on a traditional display (e.g., a monitor). This type of visualization display ...
159
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
244
click to vote
GIS
2009
ACM
16 years 7 months ago
2009
ACM
A route leads from a start location to a final destination and passes through geospatial entities that are picked according to search terms provided by the user. Each entity is pe...
156
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
182
click to vote
AMDO
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...