Sciweavers

357 search results - page 15 / 72
» Fast Hypergraph Partition
Sort
View
HT
2009
ACM
14 years 2 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
13 years 12 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
COMAD
2009
13 years 8 months ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 11 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
VLSID
2003
IEEE
167views VLSI» more  VLSID 2003»
14 years 7 months ago
Timing Minimization by Statistical Timing hMetis-based Partitioning
In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing cri...
Cristinel Ababei, Kia Bazargan