Sciweavers

15494 search results - page 193 / 3099
» Computing dynamic clusters
Sort
View
ICCV
2007
IEEE
16 years 18 days ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
CCGRID
2005
IEEE
15 years 12 months ago
NodeWiz: peer-to-peer resource discovery for grids
Efficient resource discovery based on dynamic attributes such as CPU utilization and available bandwidth is a crucial problem in the deployment of computing grids. Existing solut...
Sujoy Basu, Sujata Banerjee, Puneet Sharma, Sung-J...
IEEEPACT
2006
IEEE
16 years 9 days ago
Complexity-based program phase analysis and classification
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
Chang-Burm Cho, Tao Li
CSE
2009
IEEE
16 years 1 months ago
A Network-Aware Distributed Membership Protocol for Collaborative Defense
— To counteract current trends in network malware, distributed solutions have been developed that harness the power of collaborative end-host sensors. While these systems greatly...
David Zage, Carl Livadas, Eve M. Schooler
IPPS
2006
IEEE
16 years 9 days ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang