Sciweavers

1127 search results - page 21 / 226
» New Algorithms for Generalized Network Flows
Sort
View
TIT
2002
164views more  TIT 2002»
14 years 9 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
GIS
2008
ACM
15 years 11 months ago
Pedestrian flow prediction in extensive road networks using biased observational data
In this paper, we discuss an application of spatial data mining to predict pedestrian flow in extensive road networks using a large biased sample. Existing out-of-the-box techniqu...
Michael May, Simon Scheider, Roberto Rösler, ...
KI
2005
Springer
15 years 3 months ago
Dependency Calculus: Reasoning in a General Point Relation Algebra
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
Marco Ragni, Alexander Scivos
ITNG
2008
IEEE
15 years 4 months ago
On the Properties of System-Wide Responsive Behavior
High contention of flows is associated with unstable network behavior and unmanageable resource administration, i.e., convergence to equilibrium becomes a difficult task. In this ...
Ageliki Tsioliaridou, Vassilis Tsaoussidis
LATIN
2004
Springer
15 years 3 months ago
On the Competitiveness of AIMD-TCP within a General Network
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
Jeff Edmonds