Sciweavers

995 search results - page 51 / 199
» Minimizing Congestion in General Networks
Sort
View
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 1 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
EMNLP
2006
13 years 9 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
MOR
2006
80views more  MOR 2006»
13 years 8 months ago
Regret Minimization Under Partial Monitoring
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
CVPR
2007
IEEE
14 years 10 months ago
Real-time Gesture Recognition with Minimal Training Requirements and On-line Learning
In this paper, we introduce the semantic network model (SNM), a generalization of the hidden Markov model (HMM) that uses factorization of state transition probabilities to reduce...
Stjepan Rajko, Gang Qian, Todd Ingalls, Jodi James
NETWORKING
2004
13 years 9 months ago
Loss Strategies for Competing TCP/IP Connections
We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its t...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T...