Sciweavers

294 search results - page 22 / 59
» Interaction with the Reorderable Matrix
Sort
View
TABLEAUX
1995
Springer
14 years 9 hour ago
A Connection Based Proof Method for Intuitionistic Logic
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
Jens Otten
JCIT
2008
128views more  JCIT 2008»
13 years 8 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
ICASSP
2011
IEEE
13 years 6 days ago
L0 sparse graphical modeling
Graphical models are well established in providing compact conditional probability descriptions of complex multivariable interactions. In the Gaussian case, graphical models are d...
Goran Marjanovic, Victor Solo
WWW
2010
ACM
14 years 3 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...
DSVIS
2005
Springer
14 years 2 months ago
Automatic Critiques of Interface Modes
We introduce a formal model of inconsistency-related mode confusion. This forms the basis of a heuristic methodology for critiquing user interfaces, using a matrix algebra approach...
Jeremy Gow, Harold W. Thimbleby, Paul A. Cairns