Sciweavers

13987 search results - page 397 / 2798
» The Two Guards Problem
Sort
View
COMGEO
2008
ACM
15 years 6 months ago
Decomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
Stefan Gerdjikov, Alexander Wolff
EMNLP
2010
15 years 4 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, ...
ICCBR
2010
Springer
15 years 4 months ago
Amalgams: A Formal Approach for Combining Multiple Case Solutions
How to reuse or adapt past solutions to new problems is one of the least understood problems in case-based reasoning. In this paper we will focus on the problem of how to combine s...
Santiago Ontañón, Enric Plaza
TSP
2010
15 years 1 months ago
Joint time synchronization and localization of an unknown node in wireless sensor networks
Abstract--Time synchronization and localization are two important issues in wireless sensor networks. Although these two problems share many aspects in common, they are traditional...
Jun Zheng, Yik-Chung Wu
EMNLP
2011
14 years 6 months ago
Simple Effective Decipherment via Combinatorial Optimization
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
Taylor Berg-Kirkpatrick, Dan Klein