1836 search results - page 241 / 368 » Category Independent Object Proposals |
158
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
182
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
176
click to vote
RT
2004
Springer
15 years 11 months ago
2004
Springer
This paper proposes a new shadow map technique termed trapezoidal shadow maps to calculate high quality shadows in real-time applications. To address the resolution problem of the...
194
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
163
click to vote
CGF
2008
15 years 6 months ago
2008
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...