Sciweavers

3110 search results - page 409 / 622
» On the initialization of the DNMF algorithm
Sort
View
ICML
2000
IEEE
16 years 7 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
WWW
2006
ACM
16 years 7 months ago
Image annotation using search and mining technologies
In this paper, we present a novel solution to the image annotation problem which annotates images using search and data mining technologies. An accurate keyword is required to ini...
Xin-Jing Wang, Lei Zhang, Feng Jing, Wei-Ying Ma
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 7 months ago
On proximity oblivious testing
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
Oded Goldreich, Dana Ron
COORDINATION
2009
Springer
16 years 7 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
16 years 6 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...