Sciweavers

7536 search results - page 196 / 1508
» Localized Components Analysis
Sort
View
NIPS
2007
15 years 7 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
ICASSP
2011
IEEE
14 years 10 months ago
A Radio Frequency Identification System for accurate indoor localization
In this paper we present a novel Radio Frequency Identification (RFID) system for accurate indoor localization. The system is composed of a standard Ultra High Frequency (UHF), I...
Akshay Athalye, Vladimir Savic, Miodrag Bolic, Pet...
SAC
2004
ACM
15 years 11 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
SSD
2007
Springer
139views Database» more  SSD 2007»
16 years 14 days ago
Local Topological Relationships for Complex Regions
Topological relationships between spatial objects are important for querying, reasoning, and indexing of data within spatial databases. These relationships are qualitative and resp...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...
NIPS
2007
15 years 7 months ago
Sparse Overcomplete Latent Variable Decomposition of Counts Data
An important problem in many fields is the analysis of counts data to extract meaningful latent components. Methods like Probabilistic Latent Semantic Analysis (PLSA) and Latent ...
Madhusudana V. S. Shashanka, Bhiksha Raj, Paris Sm...