Sciweavers

7228 search results - page 672 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
COMPGEOM
2004
ACM
16 years 21 days ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
MM
2004
ACM
248views Multimedia» more  MM 2004»
16 years 21 days ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
168
Voted
GROUP
2009
ACM
15 years 12 months ago
Personalized retrieval in social bookmarking
  Users  of  social  bookmarking  systems  take  advantage  of  pivot  browsing, an interaction technique allowing them to easily refine  lists of bookmarks t...
Scott Bateman, Michael J. Muller, Jill Freyne
SIGGRAPH
1993
ACM
15 years 11 months ago
Combining hierarchical radiosity and discontinuity meshing
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
Dani Lischinski, Filippo Tampieri, Donald P. Green...
178
Voted
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
15 years 11 months ago
Configuring an evolutionary tool for the inventory and transportation problem
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
Anna Esparcia-Alcázar, Lidia Lluch-Revert, ...