Sciweavers

1220 search results - page 233 / 244
» Minimal Interval Completions
Sort
View
CASES
2005
ACM
13 years 9 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
COLT
2008
Springer
13 years 9 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
ECAI
2008
Springer
13 years 9 months ago
Task Driven Coreference Resolution for Relation Extraction
Abstract. This paper presents the extension of an existing mimimally supervised rule acquisition method for relation extraction by coreference resolution (CR). To this end, a novel...
Feiyu Xu, Hans Uszkoreit, Hong Li
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 9 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
ISCAPDCS
2007
13 years 9 months ago
Evaluation of architectural support for speech codecs application in large-scale parallel machines
— Next generation multimedia mobile phones that use the high bandwidth 3G cellular radio network consume more power. Multimedia algorithms such as speech, video transcodecs have ...
Naeem Zafar Azeemi