1604 search results - page 158 / 321 » Approximation algorithms for developable surfaces |
106
click to vote
AAAI
2011
14 years 1 months ago
2011
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
130
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
125
click to vote
EGH
2009
Springer
14 years 11 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
145
click to vote
SIAMJO
2010
15 years 1 days ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
106
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...