Sciweavers

277 search results - page 20 / 56
» Using minimum description length for process mining
Sort
View
93
Voted
COLT
2008
Springer
15 years 2 months ago
Combining Expert Advice Efficiently
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
Wouter M. Koolen, Steven de Rooij
ICDCS
2008
IEEE
15 years 6 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
SIGIR
2011
ACM
14 years 3 months ago
Mining tags using social endorsement networks
Entities on social systems, such as users on Twitter, and images on Flickr, are at the core of many interesting applications: they can be ranked in search results, recommended to ...
Theodoros Lappas, Kunal Punera, Tamás Sarlo...
125
Voted
KAIS
2006
172views more  KAIS 2006»
15 years 12 days ago
CoMMA: a framework for integrated multimedia mining using multi-relational associations
Generating captions or annotations automatically for still images is a challenging task. Traditionally, techniques involving higher-level (semantic) object detection and complex f...
Ankur Teredesai, Muhammad A. Ahmad, Juveria Kanodi...
FOCS
1999
IEEE
15 years 4 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan