Sciweavers

15033 search results - page 2848 / 3007
» Complexity Theory and Algorithms
Sort
View
EMSOFT
2009
Springer
15 years 11 months ago
Compositional deadlock detection for rendezvous communication
Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadloc...
Baolin Shao, Nalini Vasudevan, Stephen A. Edwards
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 11 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
KSEM
2009
Springer
15 years 11 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
PRIB
2009
Springer
120views Bioinformatics» more  PRIB 2009»
15 years 11 months ago
Knowledge-Guided Docking of WW Domain Proteins and Flexible Ligands
Studies of interactions between protein domains and ligands are important in many aspects such as cellular signaling. We present a knowledge-guided approach for docking protein dom...
Haiyun Lu, Hao Li, Shamima Banu Bte Sm Rashid, Wee...
SSD
2009
Springer
149views Database» more  SSD 2009»
15 years 11 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
« Prev « First page 2848 / 3007 Last » Next »