Sciweavers

1322 search results - page 121 / 265
» Parameterized counting problems
Sort
View
EDBT
2009
ACM
160views Database» more  EDBT 2009»
14 years 2 months ago
Estimating aggregates in time-constrained approximate queries in Oracle
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
ECAI
2008
Springer
13 years 12 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
DAGSTUHL
2006
13 years 11 months ago
Automatic Meaning Discovery Using Google
We have found a method to automatically extract the meaning of words and phrases from the world-wide-web using Google page counts. The approach is novel in its unrestricted proble...
Rudi Cilibrasi, Paul M. B. Vitányi
JCO
2006
126views more  JCO 2006»
13 years 10 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
CEC
2007
IEEE
14 years 4 months ago
The application of evolutionary multi-criteria optimization to dynamic molecular alignment
— This study introduces the multi-criteria approach to the optimization of dynamic molecular alignment by shaped femtosecond laser pulses, which has been considered so far only a...
Ofer M. Shir, Michael Emmerich, Thomas Bäck, ...