Sciweavers

4199 search results - page 615 / 840
» Generalizing Data in Natural Language
Sort
View
ICFP
2009
ACM
16 years 7 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
16 years 6 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
16 years 6 months ago
Style mining of electronic messages for multiple authorship discrimination: first results
This paper considers the use of computational stylistics for performing authorship attribution of electronic messages, addressing categorization problems with as many as 20 differ...
Shlomo Argamon, Marin Saric, Sterling Stuart Stein
VLDB
2001
ACM
126views Database» more  VLDB 2001»
16 years 6 months ago
Semantic integrity support in SQL: 1999 and commercial (object-)relational database management systems
The correctness of the data managed by database systems is vital to any application that utilizes data for business, research, and decision-making purposes. To guard databases agai...
Can Türker, Michael Gertz
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 6 months ago
Enabling enterprise mashups over unstructured text feeds with InfoSphere MashupHub and SystemT
Enterprise mashup scenarios often involve feeds derived from data created primarily for eye consumption, such as email, news, calendars, blogs, and web feeds. These data sources c...
David E. Simmen, Frederick Reiss, Yunyao Li, Sures...