Sciweavers

2754 search results - page 349 / 551
» Distributed Weighted Matching
Sort
View
CONCURRENCY
2004
151views more  CONCURRENCY 2004»
15 years 3 months ago
User transparency: a fully sequential programming model for efficient data parallel image processing
Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high performance computing on a daily b...
Frank J. Seinstra, Dennis Koelma
IANDC
2010
116views more  IANDC 2010»
15 years 2 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
129
Voted
ASPDAC
2010
ACM
161views Hardware» more  ASPDAC 2010»
15 years 1 months ago
A dual-MST approach for clock network synthesis
Abstract--In nanometer-scale VLSI physical design, clock network becomes a major concern on determining the total performance of digital circuit. Clock skew and PVT (Process, Volta...
Jingwei Lu, Wing-Kai Chow, Chiu-Wing Sham, Evangel...
ICPR
2010
IEEE
15 years 1 months ago
Scene Classification Using Spatial Pyramid of Latent Topics
We propose a scene classification method, which combines two popular methods in the literature: Spatial Pyramid Matching (SPM) and probabilistic Latent Semantic Analysis (pLSA) mod...
Emrah Ergul, Nafiz Arica
INFOCOM
2010
IEEE
15 years 1 months ago
Surfing the Blogosphere: Optimal Personalized Strategies for Searching the Web
We propose a distributed mechanism for finding websurfing strategies that is inspired by the StumbleUpon recommendation engine. Each day, a websurfer visits a sequence of websites ...
Stratis Ioannidis, Laurent Massoulié