Sciweavers

4039 search results - page 322 / 808
» A Method for Dynamic Clustering of Data
Sort
View
EUROPAR
2001
Springer
15 years 11 months ago
Optimal Polling for Latency-Throughput Tradeoffs in Queue-Based Network Interfaces for Clusters
We consider a networking subsystem for message–passing clusters that uses two unidirectional queues for data transfers between the network interface card (NIC) and the lower prot...
Dmitry Ponomarev, Kanad Ghose, Eugeny Saksonov
WSCG
2003
179views more  WSCG 2003»
15 years 8 months ago
Antipole Clustering for Fast Texture Synthesis
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic proce...
Sebastiano Battiato, Alfredo Pulvirenti, Diego Ref...
PAMI
2007
196views more  PAMI 2007»
15 years 6 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
ECCV
2006
Springer
16 years 8 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 10 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...