Sciweavers

4118 search results - page 273 / 824
» Efficient Algorithms for Airline Problem
Sort
View
TKDE
2008
121views more  TKDE 2008»
15 years 4 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
NAACL
2010
15 years 2 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes
EMNLP
2010
15 years 2 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...
239
Voted
ICDE
2003
IEEE
135views Database» more  ICDE 2003»
16 years 6 months ago
Discovery of High-Dimensional
Determining relationships such as functional or inclusion dependencies within and across databases is important for many applications in information integration. When such informa...
Andreas Koeller, Elke A. Rundensteiner
ICDCS
1998
IEEE
15 years 8 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen