Sciweavers

12519 search results - page 164 / 2504
» Approximation Problems Categories
Sort
View
COCOON
2006
Springer
15 years 10 months ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
E. C. Xavier, Flávio Keidi Miyazawa
ECCC
2008
98views more  ECCC 2008»
15 years 6 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
JMLR
2010
164views more  JMLR 2010»
15 years 1 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
16 years 18 days ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
IQIS
2005
ACM
15 years 12 months ago
Effective and scalable solutions for mixed and split citation problems in digital libraries
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
Dongwon Lee, Byung-Won On, Jaewoo Kang, Sanghyun P...