Sciweavers

1201 search results - page 83 / 241
» Linear Probing and Graphs
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 10 months ago
Counting Unique-Sink Orientations
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
Jan Foniok, Bernd Gärtner, Lorenz Klaus, Mark...
JMLR
2006
125views more  JMLR 2006»
15 years 4 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
ETFA
2008
IEEE
15 years 10 months ago
From monotone inequalities to Model Predictive Control
The dater equalities constitute a well-known tool which allows the description of Timed Event Graphs in the field of (max, +) algebra. This paper gives an equivalent model in the...
Abdelhak Guezzi, Philippe Declerck, Jean-Louis Boi...
CN
2008
118views more  CN 2008»
15 years 4 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
NETWORKS
2006
15 years 4 months ago
A bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Gautam Appa, Balázs Kotnyek