Sciweavers

4926 search results - page 38 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
14 years 27 days ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
COORDINATION
2004
Springer
14 years 1 months ago
CoorSet: A Development Environment for Associatively Coordinated Components
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....
Kevin Kane, James C. Browne
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
SC
2009
ACM
14 years 2 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan
COCOA
2008
Springer
13 years 9 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke