Sciweavers

511 search results - page 99 / 103
» The intrinsic dimensionality of graphs
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
CIKM
2007
Springer
14 years 4 months ago
Regularized locality preserving indexing via spectral regression
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He, Wei Vivian Zhang, Jiawei Han
ICMI
2005
Springer
164views Biometrics» more  ICMI 2005»
14 years 3 months ago
A user interface framework for multimodal VR interactions
This article presents a User Interface (UI) framework for multimodal interactions targeted at immersive virtual environments. Its configurable input and gesture processing compon...
Marc Erich Latoschik
VRST
2004
ACM
14 years 3 months ago
The MORGAN framework: enabling dynamic multi-user AR and VR projects
The availability of a suitable framework is of vital importance for the development of Augmented Reality (AR) and Virtual Reality (VR) projects. While features such as scalability...
Jan Ohlenburg, Iris Herbst, Irma Lindt, Torsten Fr...
INFOVIS
2003
IEEE
14 years 3 months ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris