Sciweavers

848 search results - page 108 / 170
» Randomness and the linear degrees of computability
Sort
View
IJISEC
2006
108views more  IJISEC 2006»
14 years 12 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
COR
2007
95views more  COR 2007»
14 years 12 months ago
Inventory routing with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
14 years 11 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
INFORMS
2010
125views more  INFORMS 2010»
14 years 10 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
ICASSP
2011
IEEE
14 years 3 months ago
Automatic speech recognition using Hidden Conditional Neural Fields
Hidden Conditional Random Fields(HCRF) is a very promising approach to model speech. However, because HCRF computes the score of a hypothesis by summing up linearly weighted featu...
Yasuhisa Fujii, Kazumasa Yamamoto, Seiichi Nakagaw...