Sciweavers

3690 search results - page 693 / 738
» Computation with classical sequents
Sort
View
WWW
2008
ACM
14 years 11 months ago
Service-oriented data denormalization for scalable web applications
Many techniques have been proposed to scale web applications. However, the data interdependencies between the database queries and transactions issued by the applications limit th...
Zhou Wei, Dejun Jiang, Guillaume Pierre, Chi-Hung ...
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
14 years 10 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
ICALP
2009
Springer
14 years 10 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
ICALP
2009
Springer
14 years 10 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...