Sciweavers

107 search results - page 4 / 22
» Adaptive search for sparse targets with informative priors
Sort
View
ICML
1994
IEEE
13 years 8 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
MOBISYS
2008
ACM
14 years 5 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste
DICTA
2003
13 years 6 months ago
Automatic Adaptive Segmentation of Moving Objects Based on Spatio-Temporal Information
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
Ofer Miller, Amir Averbuch, Yosi Keller
ACL
2008
13 years 6 months ago
Exploiting Feature Hierarchy for Transfer Learning in Named Entity Recognition
We present a novel hierarchical prior structure for supervised transfer learning in named entity recognition, motivated by the common structure of feature spaces for this task acr...
Andrew Arnold, Ramesh Nallapati, William W. Cohen
ICALP
2011
Springer
12 years 8 months ago
Content Search through Comparisons
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
Amin Karbasi, Stratis Ioannidis, Laurent Massouli&...