Sciweavers

1245 search results - page 99 / 249
» Triangulation for Points on Lines
Sort
View
RT
2004
Springer
15 years 11 months ago
PointWorks: Abstraction and Rendering of Sparsely Scanned Outdoor Environments
ks: Abstraction and Rendering of Sparsely Scanned Outdoor Environments Hui Xu, Nathan Gossett and Baoquan Chen University of Minnesota Digital Technology Center at Twin Cities † ...
Hui Xu, Nathan Gossett, Baoquan Chen
FOCS
2007
IEEE
16 years 24 days ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 7 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
15 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
CVPR
2007
IEEE
16 years 8 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit