Sciweavers

48 search results - page 3 / 10
» Graph partitioning via adaptive spectral techniques
Sort
View
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Distributed Streaming via Packet Partitioning
We propose a system for adaptive streaming from multiple servers to a single receiver over separate network paths. Based on incoming packets, the receiver estimates the available ...
Jacob Chakareski, Pascal Frossard
CSL
2011
Springer
13 years 23 days ago
Applications of graph theory to an English rhyming corpus
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
Morgan Sonderegger
ICML
2007
IEEE
14 years 6 months ago
Spectral clustering and transductive learning with multiple views
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
Dengyong Zhou, Christopher J. C. Burges
ICML
2007
IEEE
14 years 6 months ago
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
Sridhar Mahadevan
ICAPR
2005
Springer
13 years 11 months ago
Weighted Adaptive Neighborhood Hypergraph Partitioning for Image Segmentation
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
Soufiane Rital, Hocine Cherifi, Serge Miguet