Sciweavers

2182 search results - page 334 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
FOCS
1998
IEEE
15 years 6 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ML
2008
ACM
101views Machine Learning» more  ML 2008»
15 years 2 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
138
Voted
ALMOB
2006
138views more  ALMOB 2006»
15 years 2 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
131
Voted
SIAMSC
2010
116views more  SIAMSC 2010»
15 years 18 days ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw
ICDCS
2011
IEEE
14 years 1 months ago
Intelligent Placement of Datacenters for Internet Services
—Popular Internet services are hosted by multiple geographically distributed datacenters. The location of the datacenters has a direct impact on the services’ response times, c...
Iñigo Goiri, Kien Le, Jordi Guitart, Jordi ...