Sciweavers

317 search results - page 37 / 64
» Factoring logic functions using graph partitioning
Sort
View
DAC
1989
ACM
15 years 1 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
WWW
2008
ACM
15 years 10 months ago
User oriented link function classification
Currently most link-related applications treat all links in the same web page to be identical. One link-related application usually requires one certain property of hyperlinks but...
Mingliang Zhu, Weiming Hu, Ou Wu, Xi Li, Xiaoqin Z...
81
Voted
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 4 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
105
Voted
IPMI
2005
Springer
15 years 10 months ago
Analysis of Event-Related fMRI Data Using Diffusion Maps
The blood oxygen level-dependent (BOLD) signal in response to brief periods of stimulus can be detected using event-related functional magnetic resonance imaging (ER-fMRI). In this...
François G. Meyer, Xilin Shen
WWW
2005
ACM
15 years 10 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi