Sciweavers

1055 search results - page 124 / 211
» Enumerations in computable structure theory
Sort
View
COMPGEOM
2009
ACM
14 years 4 months ago
Zigzag persistent homology and real-valued functions
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
Gunnar Carlsson, Vin de Silva, Dmitriy Morozov
CIBCB
2006
IEEE
14 years 4 months ago
A Stochastic model to estimate the time taken for Protein-Ligand Docking
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
14 years 3 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
DAC
1995
ACM
14 years 1 months ago
Hierarchical Optimization of Asynchronous Circuits
Abstract— Many asynchronous designs are naturally specified and implemented hierarchically as an interconnection of separate asynchronous modules that operate concurrently and c...
Bill Lin, Gjalt G. de Jong, Tilman Kolks
PDC
2004
ACM
14 years 3 months ago
The impact of participation in information system design: a comparison of contextual placements
To compare the outcomes of participatory and user-centered contextual design, case study methods and the Activity Checklist derived from Activity Theory are used to analyze two sy...
Magnus Irestig, Henrik Eriksson, Toomas Timpka