Sciweavers

271 search results - page 25 / 55
» The lattice of embedded subsets
Sort
View
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
13 years 9 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
TCSV
2008
134views more  TCSV 2008»
13 years 9 months ago
Efficient Multiple-Description Image Coding Using Directional Lifting-Based Transform
This paper proposes an efficient two-description image coding technique. The two side descriptions of an image are generated by quincunx subsampling. The decoding from any side des...
Nan Zhang 0006, Yan Lu, Feng Wu, Xiaolin Wu, Baoca...
IJON
2011
133views more  IJON 2011»
13 years 4 months ago
Relational generative topographic mapping
Abstract. The generative topographic mapping (GTM) has been proposed as a statistical model to represent high dimensional data by means of a sparse lattice of points in latent spac...
Andrej Gisbrecht, Bassam Mokbel, Barbara Hammer
INFOCOM
1999
IEEE
14 years 1 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
NIPS
2003
13 years 10 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand