Sciweavers

131 search results - page 16 / 27
» Solution Enumeration for Projected Boolean Search Problems
Sort
View
CIKM
2009
Springer
14 years 1 months ago
Effective and efficient structured retrieval
Search engines that support structured documents typically support structure created by the author (e.g., title, section), and may also support structure added by an annotation pr...
Le Zhao, Jamie Callan
CVPR
2007
IEEE
14 years 8 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
FROCOS
2009
Springer
13 years 10 months ago
Efficient Combination of Decision Procedures for MUS Computation
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
ICDCS
2010
IEEE
13 years 4 months ago
Secure Ranked Keyword Search over Encrypted Cloud Data
As Cloud Computing becomes prevalent, sensitive information are being increasingly centralized into the cloud. For the protection of data privacy, sensitive data has to be encrypte...
Cong Wang, Ning Cao, Jin Li, Kui Ren, Wenjing Lou
COR
2010
146views more  COR 2010»
13 years 6 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz