Sciweavers

446 search results - page 79 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
ICCS
2005
Springer
14 years 1 months ago
Adaptive Surface Modeling Using a Quadtree of Quadratic Finite Elements
Abstract. This article presents special quadrilateral quadratic refinement elements, which provide geometry and field continuity across Tjunctions where two elements are connecte...
G. P. Nikishkov
IDA
2010
Springer
13 years 9 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
EMNLP
2007
13 years 9 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage
CN
2007
108views more  CN 2007»
13 years 7 months ago
On the peninsula phenomenon in web graph and its implications on web search
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
Tao Meng, Hong-Fei Yan
VISUALIZATION
1999
IEEE
13 years 11 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis