Sciweavers

5100 search results - page 636 / 1020
» The Linear Complexity of a Graph
Sort
View
CACM
2010
104views more  CACM 2010»
15 years 6 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle
CAD
2008
Springer
15 years 6 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
COR
2010
177views more  COR 2010»
15 years 6 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
DATAMINE
2006
166views more  DATAMINE 2006»
15 years 6 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
IJON
2006
53views more  IJON 2006»
15 years 6 months ago
Sub-intrapersonal space analysis for face recognition
Bayesian subspace analysis has been successfully applied in face recognition. However, it suffers from its operating on a whole face difference and using one global linear subspac...
Xiaoyang Tan, Jun Liu, Songcan Chen