Sciweavers

57 search results - page 11 / 12
» Closest point search in lattices
Sort
View
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 7 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal
ICCV
2003
IEEE
14 years 7 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
MST
2006
106views more  MST 2006»
13 years 5 months ago
More Fun with Symmetric Venn Diagrams
Abstract. Many researchers have had fun searching for and rendering symmetric Venn diagrams, culminating in the recent result of Griggs, Killian, and Savage ("Venn Diagrams an...
Frank Ruskey, Mark Weston
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 7 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
CBMS
2009
IEEE
14 years 23 days ago
Scenario-oriented information extraction from electronic health records
Providing a comprehensive set of relevant information at the point of care is crucial for making correct clinical decisions in a timely manner. Retrieval of scenario specific inf...
Anis Yousefi, Negin Mastouri, Kamran Sartipi