Sciweavers

2801 search results - page 196 / 561
» On the Adequateness of the Connection Method
Sort
View
TOG
2008
79views more  TOG 2008»
15 years 6 months ago
Continuous model synthesis
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
Paul Merrell, Dinesh Manocha
CCR
1998
75views more  CCR 1998»
15 years 6 months ago
A comparative analysis of groupware application protocols
Two of the most difficult problems faced by developers of synchronous groupware applications are the handling of multiple session connections and the maintenance of replicated dat...
Mark Pendergast
IJON
2002
72views more  IJON 2002»
15 years 6 months ago
Modeling large cortical networks with growing self-organizing maps
Self-organizing computational models with specific intracortical connections can explain many features of visual cortex. However, due to their computation and memory requirements,...
James A. Bednar, Amol Kelkar, Risto Miikkulainen
JSC
2010
96views more  JSC 2010»
15 years 5 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
ICIP
2009
IEEE
15 years 4 months ago
Blind and robust mesh watermarking using manifold harmonics
In this paper, we present a new blind and robust 3-D mesh watermarking scheme that makes use of the recently proposed manifold harmonics analysis. The mesh spectrum coefficient am...
Kai Wang, Ming Luo, Adrian G. Bors, Florence Denis