Sciweavers

2600 search results - page 215 / 520
» Clustering with or without the Approximation
Sort
View
APIN
2000
87views more  APIN 2000»
15 years 6 months ago
The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Network
: A new dynamic tree structured network - the Stochastic Competitive Evolutionary Neural Tree (SCENT) is introduced. The network is able to provide a hierarchical classification of...
Neil Davey, Rod Adams, Stella J. George
IVC
2002
192views more  IVC 2002»
15 years 6 months ago
Understanding visual behaviour
Modelling events is one of the key problems in dynamic scene analysis when salient and autonomous visual changes occuring in a scene need to be characterised effectively as meanin...
Shaogang Gong, Hilary Buxton
CLUSTER
2011
IEEE
14 years 6 months ago
Investigating Scenario-Conscious Asynchronous Rendezvous over RDMA
— In this paper, we propose a light-weight asynchronous message progression mechanism for large message transfers in Message Passing Interface (MPI) Rendezvous protocol that is s...
Judicael A. Zounmevo, Ahmad Afsahi
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
16 years 6 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
COCOA
2008
Springer
15 years 8 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth