Sciweavers

57 search results - page 6 / 12
» A new approach to the planted clique problem
Sort
View
MM
2010
ACM
115views Multimedia» more  MM 2010»
13 years 5 months ago
Interactive learning of heterogeneous visual concepts with local features
In the context of computer-assisted plant identification we are facing challenging information retrieval problems because of the very high within-class variability and of the lim...
Wajih Ouertani, Michel Crucianu, Nozha Boujemaa
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 7 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
PPSN
1998
Springer
13 years 11 months ago
Integrated Facility Design Using an Evolutionary Approach with a Subordinate Network Algorithm
The facility design problem is a common one in manufacturing and service industries and has been studied extensively in the literature. However, restrictions on the scope of the de...
Bryan A. Norman, Alice E. Smith, Rifat Aykut Arapo...
COR
2010
177views more  COR 2010»
13 years 7 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
CSDA
2007
115views more  CSDA 2007»
13 years 7 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...