Sciweavers

5595 search results - page 954 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
BMCBI
2010
175views more  BMCBI 2010»
15 years 6 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
ICDE
1998
IEEE
270views Database» more  ICDE 1998»
16 years 7 months ago
Cyclic Association Rules
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
Banu Özden, Sridhar Ramaswamy, Abraham Silber...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 6 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
16 years 10 days ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 11 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang