Sciweavers

464 search results - page 68 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
EVOW
2009
Springer
14 years 7 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
15 years 1 months ago
Incremental quantile estimation for massive tracking
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
Fei Chen, Diane Lambert, José C. Pinheiro
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
15 years 9 months ago
Toward best-effort information extraction
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...
SIGMOD
2010
ACM
211views Database» more  SIGMOD 2010»
15 years 2 months ago
ERACER: a database approach for statistical inference and data cleaning
Real-world databases often contain syntactic and semantic errors, in spite of integrity constraints and other safety measures incorporated into modern DBMSs. We present ERACER, an...
Chris Mayfield, Jennifer Neville, Sunil Prabhakar
95
Voted
CORR
2010
Springer
176views Education» more  CORR 2010»
14 years 9 months ago
Sequential item pricing for unlimited supply
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Maria-Florina Balcan, Florin Constantin