Sciweavers

561 search results - page 66 / 113
» An empirical analysis of the FixCache algorithm
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 8 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
COLT
2007
Springer
14 years 1 months ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
ISMAR
2003
IEEE
14 years 29 days ago
Evaluating Label Placement for Augmented Reality View Management
View management, a relatively new area of research in Augmented Reality (AR) applications, is about the spatial layout of 2D virtual annotations in the view plane. This paper repr...
Ronald Azuma, Chris Furmanski
JCDL
2011
ACM
244views Education» more  JCDL 2011»
12 years 10 months ago
Product review summarization from a deeper perspective
With product reviews growing in depth and becoming more numerous, it is growing challenge to acquire a comprehensive understanding of their contents, for both customers and produc...
Duy Khang Ly, Kazunari Sugiyama, Ziheng Lin, Min-Y...
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Deletion without Rebalancing in Multiway Search Trees
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
Siddhartha Sen, Robert Endre Tarjan