Sciweavers

836 search results - page 13 / 168
» On the Complexity of Train Assignment Problems
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
14 years 11 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
CAEPIA
2003
Springer
15 years 4 months ago
An Interactive Train Scheduling Tool for Solving and Plotting Running Maps
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms rai...
Federico Barber, Miguel A. Salido, Laura Paola Ing...
111
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
ICONIP
2010
14 years 9 months ago
Multi-view Gender Classification Using Hierarchical Classifiers Structure
In this paper, we propose a hierarchical classifier structure for gender classification based on facial images by reducing the complexity of the original problem. In the proposed f...
Tian-Xiang Wu, Bao-Liang Lu
BMVC
2010
14 years 9 months ago
Label propagation in complex video sequences using semi-supervised learning
We propose a novel directed graphical model for label propagation in lengthy and complex video sequences. Given hand-labelled start and end frames of a video sequence, a variation...
Ignas Budvytis, Vijay Badrinarayanan, Roberto Cipo...