Sciweavers

9842 search results - page 1660 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
WWW
2004
ACM
16 years 5 months ago
A smart hill-climbing algorithm for application server configuration
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
Bowei Xi, Zhen Liu, Mukund Raghavachari, Cathy H. ...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 5 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 5 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
CADE
2007
Springer
16 years 5 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
16 years 4 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
« Prev « First page 1660 / 1969 Last » Next »