Sciweavers

43 search results - page 7 / 9
» The total linear discrepancy of an ordered set
Sort
View
ICPR
2010
IEEE
14 years 1 months ago
Fast Training of Object Detection Using Stochastic Gradient Descent
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
Rob Wijnhoven, Peter H. N. De With
COR
2010
164views more  COR 2010»
13 years 11 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 11 months ago
Welfare Undominated Groves Mechanisms
A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing in...
Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Ev...
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
14 years 4 months ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
PVLDB
2011
13 years 1 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet