Sciweavers

385 search results - page 62 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
ALGORITHMICA
2011
13 years 4 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
CVDB
2004
ACM
14 years 2 months ago
Managing Video Collections at Large
Video document retrieval is now an active part of the domain of multimedia retrieval. However, unlike for other media, the management of a collection of video documents adds the p...
Nicolas Moënne-Loccoz, Bruno Janvier, St&eacu...
VISUALIZATION
1998
IEEE
14 years 1 months ago
Efficient warping for architectural walkthroughs using layered depth images
This paper presents efficient image-based rendering techniques used in the context of an architectural walkthrough system. Portals (doors and windows) are rendered by warping laye...
Voicu Popescu, Anselmo Lastra, Daniel G. Aliaga, M...
ICWN
2007
13 years 10 months ago
PBR: Priority Based Routing in Multi-Sink Sensor Networks
- Wireless sensor networks have been widely used in many fields with the developments of the related techniques. But there are many problems in traditional single sink sensor netwo...
Min Meng, Hui Xu, Xiaoling Wu, Brian J. d'Auriol, ...