Sciweavers

693 search results - page 43 / 139
» Categorical Properties of The Complex Numbers
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
CIKM
1998
Springer
13 years 12 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
ESA
2007
Springer
81views Algorithms» more  ESA 2007»
14 years 1 months ago
Farthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
Otfried Cheong, Hazel Everett, Marc Glisse, Joachi...
FLAIRS
2010
13 years 10 months ago
Generalized Non-impeding Noisy-AND Trees
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs assessed for each node. Its complexity is generally expon...
Yang Xiang
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 7 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi