Sciweavers

2150 search results - page 350 / 430
» On a restricted cross-intersection problem
Sort
View
SCHEDULING
2008
67views more  SCHEDULING 2008»
13 years 9 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade
AI
2011
Springer
13 years 5 months ago
Expressive markets for donating to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
Vincent Conitzer, Tuomas Sandholm
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 4 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
ICASSP
2011
IEEE
13 years 1 months ago
Semi-algebraic canonical decomposition of multi-way arrays and Joint Eigenvalue Decomposition
A semi-algebraic algorithm based on Joint EigenValue Decomposition (JEVD) is proposed to compute the CP decomposition of multi-way arrays. The iterative part of the method is thus...
Xavier Luciani, Laurent Albera
CVPR
2009
IEEE
1351views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Support Vector Machines in Face Recognition with Occlusions
Support Vector Machines (SVM) are one of the most useful techniques in classification problems. One clear example is face recognition. However, SVM cannot be applied when the fe...
Aleix M. Martínez, Hongjun Jia