Sciweavers

1064 search results - page 168 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
137
Voted
SIGGRAPH
2000
ACM
15 years 7 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
ICIP
2006
IEEE
16 years 5 months ago
Two-Stage Optimal Component Analysis
Linear techniques are widely used to reduce the dimension of image representation spaces in applications such as image indexing and object recognition. Optimal Component Analysis ...
Yiming Wu, Xiuwen Liu, Washington Mio, Kyle A. Gal...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 4 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 4 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
170
Voted
AIPS
2009
15 years 5 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden