Sciweavers

1993 search results - page 89 / 399
» Data integration with dependent sources
Sort
View
WEA
2009
Springer
145views Algorithms» more  WEA 2009»
15 years 4 months ago
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
Reinhard Bauer, Dorothea Wagner
SIGSOFT
2010
ACM
14 years 7 months ago
LINKSTER: enabling efficient manual inspection and annotation of mined data
While many uses of mined software engineering data are automatic in nature, some techniques and studies either require, or can be improved, by manual methods. Unfortunately, manua...
Christian Bird, Adrian Bachmann, Foyzur Rahman, Ab...
COOPIS
1997
IEEE
15 years 2 months ago
Semi-Automatic Wrapper Generation for Internet Information Sources
To simplify the task of obtaining information from the vast number of information sources that are available on the World Wide Web (WWW), we are building tools to build informatio...
Naveen Ashish, Craig A. Knoblock
ISSRE
2005
IEEE
15 years 3 months ago
Helping End-Users "Engineer" Dependable Web Applications
End-user programmers are increasingly relying on web authoring environments to create web applications. Although often consisting primarily of web pages, such applications are inc...
Sebastian G. Elbaum, Kalyan-Ram Chilakamarri, Bhuv...
ACL
2010
14 years 7 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa