Sciweavers

1629 search results - page 176 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ASAP
2006
IEEE
142views Hardware» more  ASAP 2006»
15 years 5 days ago
NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm
In this paper, a routing model for minimizing hot spots in the network on chip (NOC) is presented. The model makes use of AntNet routing algorithm which is based on Ant colony. Us...
Masoud Daneshtalab, Ashkan Sobhani, Ali Afzali-Kus...
CORR
2010
Springer
85views Education» more  CORR 2010»
14 years 10 months ago
The Motif Tracking Algorithm
: The search for patterns or motifs in data represents a problem area of key interest to finance and economic researchers. In this paper we introduce the Motif Tracking Algorithm, ...
William O. Wilson, Phil Birkin, Uwe Aickelin
68
Voted
TCAD
2002
98views more  TCAD 2002»
14 years 9 months ago
An Esterel compiler for large control-dominated systems
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...
Stephen A. Edwards
SIGOPSE
2000
ACM
15 years 2 months ago
An algorithm for stabilising multiple stores
The algorithm for stabilising multiple stores, which we present in this paper, was developed in the process of designing the global stability and resilience mechanism for Grasshopp...
Ewa Z. Bem, John Rosenberg
87
Voted
CVPR
2004
IEEE
16 years 7 days ago
A Fast Multigrid Implicit Algorithm for the Evolution of Geodesic Active Contours
Active contour models are among the most popular PDE-based tools in computer vision. In this paper we present a new algorithm for the fast evolution of geodesic active contours an...
George Papandreou, Petros Maragos