Sciweavers

3656 search results - page 266 / 732
» Compact Location Problems
Sort
View
STACS
1999
Springer
15 years 10 months ago
Decidability and Undecidability of Marked PCP
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
Vesa Halava, Mika Hirvensalo, Ronald de Wolf
CCCG
2010
15 years 8 months ago
Direction assignment in wireless networks
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthe...
CCCG
2008
15 years 8 months ago
Maximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
RSA
2010
81views more  RSA 2010»
15 years 4 months ago
Percolation of arbitrary words in one dimension
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation...
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Ri...
NAACL
2010
15 years 4 months ago
Probabilistic Frame-Semantic Parsing
This paper contributes a formalization of frame-semantic parsing as a structure prediction problem and describes an implemented parser that transforms an English sentence into a f...
Dipanjan Das, Nathan Schneider, Desai Chen, Noah A...