Sciweavers

6395 search results - page 1196 / 1279
» Searching for Interacting Features
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 2 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
BIRTHDAY
1991
Springer
15 years 2 months ago
The Markgraf Karl Refutation Procedure
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
Hans Jürgen Ohlbach, Jörg H. Siekmann
CVPR
2010
IEEE
15 years 2 months ago
Classification and Clustering via Dictionary Learning with Structured Incoherence
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapir...
ATAL
2008
Springer
15 years 1 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis
ATAL
2008
Springer
15 years 1 months ago
On the importance of migration for fairness in online grid markets
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
« Prev « First page 1196 / 1279 Last » Next »