Sciweavers

3946 search results - page 279 / 790
» The computational complexity of choice sets
Sort
View
FDG
2009
ACM
16 years 1 months ago
Perspectives, frame rates and resolutions: it's all in the game
Hardware and platform limitations restrict the display settings for most computer games, forcing a tradeoff between frame rate and resolution to achieve acceptable performance. Pr...
Mark Claypool, Kajal T. Claypool
PAMI
2010
276views more  PAMI 2010»
15 years 5 months ago
Local-Learning-Based Feature Selection for High-Dimensional Data Analysis
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
Yijun Sun, Sinisa Todorovic, Steve Goodison
ICCS
2004
Springer
16 years 3 days ago
Point-Based Modeling from a Single Image
Abstract. The complexity of virtual environments has grown spectacularly over the recent years, mainly thanks to the use of the currently cheap high performance graphics cards. As ...
Pere-Pau Vázquez, Jordi Marco, Mateu Sbert
155
Voted
SMI
2005
IEEE
16 years 10 days ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
15 years 11 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt