Sciweavers

2754 search results - page 282 / 551
» Distributed Weighted Matching
Sort
View
109
Voted
IJVR
2007
85views more  IJVR 2007»
15 years 3 months ago
Detection of Landmarks for Clustering of Online-Game Players
—Understanding of player behaviors is an important issue to keep online games interesting to their players. Focusing on player movement, in our previous work, we proposed a metho...
Ruck Thawonmas, Masayoshi Kurashige, Kuan-Ta Chen
130
Voted
ML
2002
ACM
141views Machine Learning» more  ML 2002»
15 years 3 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
153
Voted
ENTCS
2007
190views more  ENTCS 2007»
15 years 2 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
144
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...
141
Voted
NETWORKS
2010
15 years 1 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...