Sciweavers

805 search results - page 54 / 161
» Modeling and Analyzing Periodic Distributed Computations
Sort
View
COMPUTE
2010
ACM
14 years 1 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
MSWIM
2004
ACM
14 years 2 months ago
Mobile dynamic content distribution networks
Mobile networks are becoming increasingly popular as a means for distributing information to a large number of users. In comparison to wired networks, mobile networks are distingu...
Wagner Moro Aioffi, Geraldo Robson Mateus, Jussara...
WSC
2004
13 years 10 months ago
Data Farming: Discovering Surprise
Data Farming is a methodology and capability that makes use of high performance computing to run models many times. This capability gives modelers and their clients the enhanced a...
Gary E. Horne, Theodore E. Meyer
CCGRID
2009
IEEE
14 years 4 months ago
Scheduling Strategies for Cycle Scavenging in Multicluster Grid Systems
The use of today’s multicluster grids exhibits periods of submission bursts with periods of normal use and even of idleness. To avoid resource contention, many users employ obse...
Omer Ozan Sonmez, Bart Grundeken, Hashim H. Mohame...
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
14 years 3 months ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...