Sciweavers

12148 search results - page 55 / 2430
» Generalized Bundle Methods
Sort
View
NIPS
2008
13 years 9 months ago
Supervised Exponential Family Principal Component Analysis via Convex Optimization
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
Yuhong Guo
SIGIR
2008
ACM
13 years 7 months ago
Compressed collections for simulated crawling
Collections are a fundamental tool for reproducible evaluation of information retrieval techniques. We describe a new method for distributing the document lengths and term counts ...
Alessio Orlandi, Sebastiano Vigna
ATMOS
2010
163views Optimization» more  ATMOS 2010»
13 years 6 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...
ATMOS
2010
150views Optimization» more  ATMOS 2010»
13 years 6 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg
ISCAS
1993
IEEE
86views Hardware» more  ISCAS 1993»
13 years 12 months ago
A Generalized Precompiling scheme for Surviving Path Memory Management in Viterbi decoders
The management of the surviving path memory in Viterbi's algorithm is generally performed by Trace-Back or Exchange.Register. A generalized method using precompiled trace-back...
Emmanuel Boutillon, N. Demassieux