Sciweavers

14548 search results - page 2731 / 2910
» The Optimal Path-Matching Problem
Sort
View
DAIS
2003
15 years 7 months ago
Planning for Network-Aware Paths
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...
Xiaodong Fu, Vijay Karamcheti
ICHIM
2001
139views more  ICHIM 2001»
15 years 7 months ago
Automated 3D Recording of Archaeological Pottery
At excavations a large number of sherds of archaeological pottery is found. Since the documentation and administration of these fragments represent a temporal and personnel effort...
Martin Kampel, Robert Sablatnig
NIPS
2004
15 years 7 months ago
Spike Sorting: Bayesian Clustering of Non-Stationary Data
Spike sorting involves clustering spike trains recorded by a microelectrode according to the source neuron. It is a complicated problem, which requires a lot of human labor, partl...
Aharon Bar-Hillel, Adam Spiro, Eran Stark
OPODIS
2004
15 years 7 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
PDCN
2004
15 years 7 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
« Prev « First page 2731 / 2910 Last » Next »