Sciweavers

761 search results - page 123 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
TEC
2010
191views more  TEC 2010»
13 years 2 months ago
Particle Swarm Optimization Aided Orthogonal Forward Regression for Unified Data Modeling
We propose a unified data modeling approach that is equally applicable to supervised regression and classification applications, as well as to unsupervised probability density func...
Sheng Chen, Xia Hong, Chris J. Harris
TON
2008
99views more  TON 2008»
13 years 7 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 8 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 9 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
TCS
2008
13 years 7 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...