Sciweavers

228 search results - page 9 / 46
» An effective theory of type refinements
Sort
View
ACS
2004
13 years 7 months ago
Descent Theory for Schemes
In this paper we continue the investigation of some aspects of descent theory for schemes that was begun in [11]. Let SCH be a category of schemes. We show that quasi-compact pure ...
Bachuki Mesablishvili
ICDM
2006
IEEE
109views Data Mining» more  ICDM 2006»
14 years 1 months ago
Star-Structured High-Order Heterogeneous Data Co-clustering Based on Consistent Information Theory
Heterogeneous object co-clustering has become an important research topic in data mining. In early years of this research, people mainly worked on two types of heterogeneous data ...
Bin Gao, Tie-Yan Liu, Wei-Ying Ma
WWW
2005
ACM
14 years 8 months ago
Expressiveness of XSDs: from practice to theory, there and back again
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Sc...
ICFP
2008
ACM
14 years 7 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
CIKM
2008
Springer
13 years 9 months ago
Mining term association patterns from search logs for effective query reformulation
Search engine logs are an emerging new type of data that offers interesting opportunities for data mining. Existing work on mining such data has mostly attempted to discover knowl...
Xuanhui Wang, ChengXiang Zhai