Sciweavers

1872 search results - page 103 / 375
» The Art of Granular Computing
Sort
View
IPPS
2009
IEEE
15 years 7 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
84
Voted
KIVS
2007
Springer
15 years 7 months ago
A System for in-Network Anomaly Detection
Today, the Internet is used by companies frequently since it simplifies daily work, speeds up communication, and saves money. But the more popular the Internet gets the more it su...
Thomas Gamer
122
Voted
ACL2
2006
ACM
15 years 6 months ago
Adding parallelism capabilities to ACL2
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
David L. Rager
ISPAN
2005
IEEE
15 years 6 months ago
Dynamic Estimation of Task Level Parallelism with Operating System Support
The amount of Task Level Parallelism (TLP) in runtime workload is useful information to determine the efficient usage of multiprocessors. This paper presents mechanisms to dynami...
Luong Dinh Hung, Shuichi Sakai
IWCIA
2004
Springer
15 years 6 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo