Sciweavers

320 search results - page 64 / 64
» A Theory of Spatio-Temporal Database Queries
Sort
View
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
16 years 16 hour ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
83
Voted
POPL
2010
ACM
15 years 9 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
117
Voted
RECSYS
2010
ACM
14 years 11 months ago
Collaborative filtering via euclidean embedding
Recommendation systems suggest items based on user preferences. Collaborative filtering is a popular approach in which recommending is based on the rating history of the system. O...
Mohammad Khoshneshin, W. Nick Street
JAR
2006
236views more  JAR 2006»
14 years 11 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
DIMACS
1996
15 years 28 days ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin