Sciweavers

120 search results - page 23 / 24
» Cycle lengths in sparse graphs
Sort
View
SLIP
2003
ACM
15 years 2 months ago
Fast estimation of the partitioning rent characteristic using a recursive partitioning model
In the past, a priori interconnect prediction, based on Rent’s rule, has been applied mainly for technology evaluation and roadmap applications. These applications do not requir...
Joni Dambre, Dirk Stroobandt, Jan Van Campenhout
MICRO
1998
IEEE
91views Hardware» more  MICRO 1998»
15 years 1 months ago
Effective Cluster Assignment for Modulo Scheduling
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
Erik Nystrom, Alexandre E. Eichenberger
79
Voted
CGF
1998
104views more  CGF 1998»
14 years 9 months ago
Animation of Biological Organ Growth Based on L-systems
In contrast with the growth of plants and trees, human organs can undergo signi cant changes in shape through a variety of global transformations during the growth period, such as...
Roman Durikovic, Kazufumi Kaneda, Hideo Yamashita
IEEESCC
2009
IEEE
14 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
INFOCOM
2005
IEEE
15 years 3 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash