Sciweavers

1300 search results - page 159 / 260
» Association Schemoids and Their Categories
Sort
View
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
15 years 11 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
KDD
2003
ACM
142views Data Mining» more  KDD 2003»
15 years 11 months ago
Frequent-subsequence-based prediction of outer membrane proteins
A number of medically important disease-causing bacteria (collectively called Gram-negative bacteria) are noted for the extra "outer" membrane that surrounds their cell....
Rong She, Fei Chen 0002, Ke Wang, Martin Ester, Je...
SIGMOD
2008
ACM
109views Database» more  SIGMOD 2008»
15 years 11 months ago
Cooperative XPath caching
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...
Kostas Lillis, Evaggelia Pitoura
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 11 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
93
Voted
ICFP
2005
ACM
15 years 11 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...