Sciweavers

1221 search results - page 124 / 245
» Balanced graph partitioning
Sort
View
WWW
2011
ACM
13 years 5 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh
VR
2002
IEEE
210views Virtual Reality» more  VR 2002»
14 years 3 months ago
Distributed Applications for Collaborative Augmented Reality
This paper focuses on the distributed architecture of the collaborative augmented reality system Studierstube. The system allows multiple users to experience a shared 3D workspace...
Dieter Schmalstieg, Gerd Hesina
PAMI
2010
396views more  PAMI 2010»
13 years 8 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu
WADS
1993
Springer
115views Algorithms» more  WADS 1993»
14 years 2 months ago
Parallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
Marshall W. Bern, David Eppstein, Shang-Hua Teng
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 2 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu