Sciweavers

2926 search results - page 487 / 586
» Computer graphics identification using genetic algorithm
Sort
View
DM
2006
128views more  DM 2006»
13 years 8 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
BMCBI
2008
214views more  BMCBI 2008»
13 years 8 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Mesh Decomposition with Cross-Boundary Brushes
We present a new intuitive UI, which we call cross-boundary brushes, for interactive mesh decomposition. The user roughly draws one or more strokes across a desired cut and our sy...
Youyi Zheng and Chiew-Lan Tai
ISMAR
2006
IEEE
14 years 1 months ago
Implementation of god-like interaction techniques for supporting collaboration between outdoor AR and indoor tabletop users
This paper presents a new interaction metaphor we have termed “god-like interaction”. This is a metaphor for improved communication of situational and navigational information...
Aaron Stafford, Wayne Piekarski, Bruce H. Thomas
COMPGEOM
2011
ACM
12 years 11 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...