Sciweavers

79 search results - page 16 / 16
» Hypertree Decompositions: Structure, Algorithms, and Applica...
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 5 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
COMGEO
1999
ACM
13 years 4 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
COMPGEOM
2003
ACM
13 years 10 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
ICTIR
2009
Springer
13 years 11 months ago
PageRank: Splitting Homogeneous Singular Linear Systems of Index One
Abstract. The PageRank algorithm is used today within web information retrieval to provide a content-neutral ranking metric over web pages. It employs power method iterations to so...
Douglas V. de Jager, Jeremy T. Bradley