Sciweavers

2218 search results - page 377 / 444
» Testing Expressibility Is Hard
Sort
View
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 9 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
ICFP
2001
ACM
14 years 9 months ago
Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...
Allyn Dimock, Ian Westmacott, Robert Muller, Frank...
WSDM
2010
ACM
236views Data Mining» more  WSDM 2010»
14 years 6 months ago
Personalized Click Prediction in Sponsored Search
Sponsored search is a multi-billion dollar business that generates most of the revenue for search engines. Predicting the probability that users click on ads is crucial to sponsor...
Erick Cantú-Paz, Haibin Cheng
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 6 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
EUROSYS
2010
ACM
14 years 6 months ago
Execution Synthesis: A Technique for Automated Software Debugging
Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn int...
Cristian Zamfir, George Candea