Sciweavers

4302 search results - page 734 / 861
» Index Pairs Algorithms
Sort
View
FUIN
2010
89views more  FUIN 2010»
13 years 7 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
IFIP12
2010
13 years 7 months ago
Learning the Preferences of News Readers with SVM and Lasso Ranking
We attack the task of predicting which news-stories are more appealing to a given audience by comparing ‘most popular stories’, gathered from various online news outlets, over ...
Elena Hensinger, Ilias N. Flaounas, Nello Cristian...
INFOCOM
2010
IEEE
13 years 7 months ago
Recognizing Exponential Inter-Contact Time in VANETs
—Inter-contact time between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs) and central to forwarding algorithms and the end-to-end delay. Due to ...
Hongzi Zhu, Luoyi Fu, Guangtao Xue, Yanmin Zhu, Mi...
INFOCOM
2010
IEEE
13 years 7 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
JAIR
2010
131views more  JAIR 2010»
13 years 7 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan