Sciweavers

9405 search results - page 1535 / 1881
» Computing a Model of Set Theory
Sort
View
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 5 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
PR
2010
156views more  PR 2010»
15 years 5 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier
ICIP
2009
IEEE
15 years 4 months ago
Object tracking using multiple fragments
This paper presents a low-cost tracking algorithm based on multiple multiple fragments, increasing robustness with respect to partial occlusions. Given the initial template repres...
Claudio R. Jung, Amir Said
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
ICPR
2004
IEEE
16 years 7 months ago
Object Class Recognition using Images of Abstract Regions
lass Recognition using Images of Abstract Regions Yi Li, Jeff A. Bilmes, and Linda G. Shapiro Department of Computer Science and Engineering Department of Electrical Engineering Un...
Jeff A. Bilmes, Linda G. Shapiro, Yi Li
« Prev « First page 1535 / 1881 Last » Next »