Sciweavers

3136 search results - page 180 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
CCGRID
2009
IEEE
16 years 1 months ago
Developing Scheduling Policies in gLite Middleware
We describe our experiences from implementing and integrating a new job scheduling algorithm in the gLite Grid middleware and present experimental results that compare it to the e...
A. Kretsis, Panagiotis C. Kokkinos, Emmanouel A. V...
UIST
2006
ACM
16 years 11 days ago
Viz: a visual analysis suite for explaining local search behavior
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
ICDE
2009
IEEE
186views Database» more  ICDE 2009»
16 years 8 months ago
A Benchmark for Online Index Selection
Online approaches to physical design tuning have received considerable attention in the recent literature, with a focus on the problem of online index selection. However, it is dif...
Karl Schnaitter, Neoklis Polyzotis
ICIP
2005
IEEE
16 years 8 months ago
Parameter estimation of multi-dimensional hidden Markov models - a scalable approach
Parameter estimation is a key computational issue in all statistical image modeling techniques. In this paper, we explore a computationally efficient parameter estimation algorith...
Dhiraj Joshi, Jia Li, James Ze Wang
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
16 years 6 months ago
On the limits of cache-obliviousness
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...
Gerth Stølting Brodal, Rolf Fagerberg