Sciweavers

1041 search results - page 86 / 209
» Randomizing Reductions of Search Problems
Sort
View
DICTA
2003
13 years 9 months ago
Synthesising Textures Using Variable Neighbourhood Searching
Abstract. Texture synthesis aims to define and reproduce discriminating image features. These features are used to associate with and differentiate between two textures. Often tex...
Minh Tran, Amitava Datta
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CIKM
2009
Springer
14 years 2 months ago
Automatic retrieval of similar content using search engine query interface
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
Ali Dasdan, Paolo D'Alberto, Santanu Kolay, Chris ...
ICSM
2006
IEEE
14 years 2 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...
CVPR
2010
IEEE
13 years 10 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...