Sciweavers

1141 search results - page 5 / 229
» Experiences and directions in pushpin computing
Sort
View
IS
2006
13 years 8 months ago
A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
Li Xu, David W. Embley
DISOPT
2008
91views more  DISOPT 2008»
13 years 8 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
Alper Atamtürk, Deepak Rajan
BIOINFORMATICS
2005
140views more  BIOINFORMATICS 2005»
13 years 8 months ago
Profile-based direct kernels for remote homology detection and fold recognition
Motivation: Remote homology detection between protein sequences is a central problem in computational biology. Supervised learning algorithms based on support vector machines are ...
Huzefa Rangwala, George Karypis
ACL
2003
13 years 10 months ago
Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data
This paper proposes the “Hierarchical Directed Acyclic Graph (HDAG) Kernel” for structured natural language data. The HDAG Kernel directly accepts several levels of both chunk...
Jun Suzuki, Tsutomu Hirao, Yutaka Sasaki, Eisaku M...
BVAI
2007
Springer
14 years 2 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...