Sciweavers

2376 search results - page 211 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
124
Voted
APPINF
2003
15 years 5 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
117
Voted
IEICET
2006
56views more  IEICET 2006»
15 years 3 months ago
Reconfiguration Heuristics for Logical Topologies in Wide-Area WDM Networks
Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to kee...
Hironao Takagi, Yongbing Zhang, Hideaki Takagi
130
Voted
NIPS
2008
15 years 5 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
136
Voted
CVPR
2003
IEEE
16 years 5 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
208
Voted
ICDE
2005
IEEE
111views Database» more  ICDE 2005»
16 years 5 months ago
Schema Matching using Duplicates
Most data integration applications require a matching between the schemas of the respective data sets. We show how the existence of duplicates within these data sets can be exploi...
Alexander Bilke, Felix Naumann