Sciweavers

2436 search results - page 285 / 488
» Evaluating Adaptive Problem Selection
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
15 years 3 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
ACL
2012
13 years 6 months ago
Collective Generation of Natural Image Descriptions
We present a holistic data-driven approach to image description generation, exploiting the vast amount of (noisy) parallel image data and associated natural language descriptions ...
Polina Kuznetsova, Vicente Ordonez, Alexander C. B...
PIMRC
2008
IEEE
15 years 10 months ago
A joint routing-MAC model for cellular-relaying networks
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
Bogdan Timus, Pablo Soldati
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
Robust incentive techniques for peer-to-peer networks
Lack of cooperation (free riding) is one of the key problems that confronts today’s P2P systems. What makes this problem particularly difficult is the unique set of challenges ...
Michal Feldman, Kevin Lai, Ion Stoica, John Chuang
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 5 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth