1604 search results - page 234 / 321 » Regularization on Discrete Spaces |
235
click to vote
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
Latent semantic analysis (LSA), as one of the most popular unsupervised dimension reduction tools, has a wide range of applications in text mining and information retrieval. The k...
125
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
125
click to vote
SIAMSC
2008
15 years 3 months ago
2008
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
158
click to vote
CAD
2004
Springer
15 years 3 months ago
2004
Springer
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
170
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...