Sciweavers

434 search results - page 17 / 87
» A Semantic Caching Method Based on Linear Constraints
Sort
View
COR
2011
13 years 3 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
IJCNLP
2004
Springer
14 years 2 months ago
Bilingual Chunk Alignment Based on Interactional Matching and Probabilistic Latent Semantic Indexing
Abstract. An integrated method for bilingual chunk partition and alignment, called “Interactional Matching”, is proposed in this paper. Different from former works, our method...
Feifan Liu, Qianli Jin, Jun Zhao, Bo Xu
DKE
2008
104views more  DKE 2008»
13 years 8 months ago
Improving the performance of question answering with semantically equivalent answer patterns
In this paper, we discuss a novel technique based on semantic constraints to improve the performance and portability of a reformulation-based question answering system. First, we ...
Leila Kosseim, Jamileh Yousefi
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 2 months ago
Security Conscious Web Service Composition with Semantic Web Support
A Web service is a software system designed to support interoperable application-to-application interactions over the Internet. Recently, there has been a growing interest in Web ...
Barbara Carminati, Elena Ferrari, Ryan Bishop, Pat...
ECAI
2008
Springer
13 years 10 months ago
Optimizing Causal Link Based Web Service Composition
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. Since Web services have been enhanced with formal semantic descriptio...
Freddy Lécué, Alexandre Delteil, Ala...