Sciweavers

2887 search results - page 348 / 578
» Name Generation and Linearity
Sort
View
SIAMJO
2002
149views more  SIAMJO 2002»
15 years 6 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
Christian Kanzow, Christian Nagel
TIT
2002
99views more  TIT 2002»
15 years 6 months ago
Poisson intensity estimation for tomographic data using a wavelet shrinkage approach
We consider a two-dimensional problem of positron emission tomography where the random mechanism of the generation of the tomographic data is modeled by Poisson processes. The goa...
L. Cavalier, Ja-Yong Koo
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...
IJAR
2010
152views more  IJAR 2010»
15 years 5 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
JAIR
2010
99views more  JAIR 2010»
15 years 5 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...