Sciweavers

625 search results - page 45 / 125
» Topologically Adaptable Snakes
Sort
View
CPC
2006
132views more  CPC 2006»
13 years 11 months ago
Duality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
Henning Bruhn, Reinhard Diestel
WWW
2004
ACM
14 years 11 months ago
Small world peer networks in distributed web search
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...
Ruj Akavipat, Le-Shin Wu, Filippo Menczer
IPTPS
2005
Springer
14 years 4 months ago
Hybrid Overlay Structure Based on Random Walks
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...
Ruixiong Tian, Yongqiang Xiong, Qian Zhang, Bo Li,...
VISUALIZATION
2000
IEEE
14 years 3 months ago
Semi-regular mesh extraction from volumes
We present a novel method to extract iso-surfaces from distance volumes. It generates high quality semi-regular multiresolution meshes of arbitrary topology. Our technique proceed...
Zoë J. Wood, Peter Schröder, David E. Br...
DAC
1995
ACM
14 years 2 months ago
DARWIN: CMOS Opamp Synthesis by Means of a Genetic Algorithm
—DARWIN is a tool that is able to synthesize CMOS opamps, on the basis of a genetic algorithm. A randomly generated initial set of opamps evolves to a set in which the topologies...
Wim Kruiskamp, Domine Leenaerts