Sciweavers

492 search results - page 90 / 99
» Fast data stream algorithms using associative memories
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
12 years 10 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 1 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
AAAI
2008
13 years 10 months ago
An Effective and Robust Method for Short Text Classification
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...
Victoria Bobicev, Marina Sokolova
TROB
2008
123views more  TROB 2008»
13 years 7 months ago
iSAM: Incremental Smoothing and Mapping
We present incremental smoothing and mapping (iSAM), a novel approach to the simultaneous localization and mapping problem that is based on fast incremental matrix factorization. i...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
JCC
2008
125views more  JCC 2008»
13 years 7 months ago
Efficient electronic integrals and their generalized derivatives for object oriented implementations of electronic structure cal
: For the new parallel implementation of electronic structure methods in ACES III (Lotrich et al., in preparation) the present state-of-the-art algorithms for the evaluation of ele...
Norbert Flocke, Victor Lotrich