Sciweavers

3025 search results - page 598 / 605
» Computational geometry: a retrospective
Sort
View
APGV
2007
ACM
130views Visualization» more  APGV 2007»
14 years 1 months ago
A perceptual approach to trimming unstructured lumigraphs
We present a novel perceptual method to reduce the visual redundancy of unstructured lumigraphs, an image based representation designed for interactive rendering. We combine featu...
Yann Morvan, Carol O'Sullivan
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
14 years 1 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
CSB
2004
IEEE
112views Bioinformatics» more  CSB 2004»
14 years 1 months ago
Reasoning about Molecular Similarity and Properties
Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notio...
Rahul Singh
SGP
2004
14 years 6 days ago
Geometric Texture Synthesis by Example
Patterns on real-world objects are often due to variations in geometry across the surface. Height fields and other common parametric methods cannot synthesize many forms of geomet...
Pravin Bhat, Stephen Ingram, Greg Turk
AAAI
2008
14 years 4 days ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang