Sciweavers

8486 search results - page 199 / 1698
» Ordered Enumeration Method
Sort
View
CPAIOR
2006
Springer
14 years 22 days ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
EMNLP
2007
14 years 6 days ago
Tree Kernel-Based Relation Extraction with Context-Sensitive Structured Parse Tree Information
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for r...
Guodong Zhou, Min Zhang, Dong-Hong Ji, Qiaoming Zh...
IPCO
2008
118views Optimization» more  IPCO 2008»
14 years 6 days ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
14 years 5 days ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...
AAAI
2006
14 years 5 days ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...