Sciweavers

633 search results - page 88 / 127
» Locality and Hard SAT-Instances
Sort
View
AI
2000
Springer
13 years 9 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
MICRO
2007
IEEE
113views Hardware» more  MICRO 2007»
13 years 9 months ago
The High Cost of a Cheap Lesson
y abstract, it is grounded in the experience of many markets. As I will illustrate, it explains much strategic behavior. Information spreads With a bit of effort, any technically s...
Shane Greenstein
IJPRAI
2010
151views more  IJPRAI 2010»
13 years 8 months ago
Structure-Embedded AUC-SVM
: AUC-SVM directly maximizes the area under the ROC curve (AUC) through minimizing its hinge loss relaxation, and the decision function is determined by those support vector sample...
Yunyun Wang, Songcan Chen, Hui Xue
MM
2010
ACM
402views Multimedia» more  MM 2010»
13 years 8 months ago
Discriminative codeword selection for image representation
Bag of features (BoF) representation has attracted an increasing amount of attention in large scale image processing systems. BoF representation treats images as loose collections...
Lijun Zhang 0005, Chun Chen, Jiajun Bu, Zhengguang...
3DOR
2010
13 years 5 months ago
Learning the Compositional Structure of Man-Made Objects for 3D Shape Retrieval
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...
Raoul Wessel, Reinhard Klein