Sciweavers

5316 search results - page 95 / 1064
» Which Search Problems Are Random
Sort
View
CVPR
2007
IEEE
16 years 5 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
CP
1999
Springer
15 years 7 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
ICDE
2010
IEEE
213views Database» more  ICDE 2010»
15 years 6 months ago
TargetSearch: A Ranking Friendly XML Keyword Search Engine
Abstract-- This demo illustrates an XML search engine TargetSearch that addresses an open problem in XML keyword search: given relevant matches to keywords, how to compose query re...
Ziyang Liu, Yichuan Cai, Yi Chen
123
Voted
FLAIRS
2004
15 years 4 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
132
Voted
EKAW
2006
Springer
15 years 7 months ago
SemSearch: A Search Engine for the Semantic Web
Semantic search promises to produce precise answers to user queries by taking advantage of the availability of explicit semantics of information in the context of the semantic web....
Yuangui Lei, Victoria S. Uren, Enrico Motta