Sciweavers

774 search results - page 25 / 155
» Process Discovery Using Integer Linear Programming
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
ML
1998
ACM
115views Machine Learning» more  ML 1998»
13 years 8 months ago
Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL
This paper is a case study of a machine aided knowledge discovery process within the general area of drug design. More speci cally, the paper describes a sequence of experiments in...
Paul W. Finn, Stephen Muggleton, David Page, Ashwi...
PKDD
2000
Springer
151views Data Mining» more  PKDD 2000»
14 years 14 days ago
Discovery of Characteristic subgraph Patterns Using Relative Indexing and the Cascade Model
: Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that...
Takashi Okada, Mayumi Oyama
ACL
2010
13 years 7 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
CIKM
2011
Springer
12 years 8 months ago
Joint inference for cross-document information extraction
Previous information extraction (IE) systems are typically organized as a pipeline architecture of separated stages which make independent local decisions. When the data grows bey...
Qi Li, Sam Anzaroot, Wen-Pin Lin, Xiang Li, Heng J...