Sciweavers

3656 search results - page 98 / 732
» Compact Location Problems
Sort
View
168
Voted
WMCSA
2012
IEEE
13 years 8 months ago
SpinLoc: spin once to know your location
The rapid growth of location-based applications has spurred extensive research on localization. Nonetheless, indoor localization remains an elusive problem mostly because the accu...
Souvik Sen, Romit Roy Choudhury, Srihari Nelakudit...
PKDD
2009
Springer
92views Data Mining» more  PKDD 2009»
15 years 7 months ago
A Generic Approach to Topic Models
This article contributes a generic model of topic models. To define the problem space, general characteristics for this class of models are derived, which give rise to a represent...
Gregor Heinrich
WG
2005
Springer
15 years 6 months ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul
ICML
2010
IEEE
15 years 1 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
81
Voted
IJISTA
2008
87views more  IJISTA 2008»
15 years 21 days ago
On fusion of range and intensity information using Graph-Cut for planar patch segmentation
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...
Olaf Kähler, Erik Rodner, Joachim Denzler