Sciweavers

159 search results - page 6 / 32
» Open Problems from CCCG 2008
Sort
View
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 9 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
ITA
2008
123views Communications» more  ITA 2008»
13 years 7 months ago
On some problems related to palindrome closure
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
IEEEARES
2008
IEEE
14 years 1 months ago
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
Zhiyao Liang, Rakesh M. Verma
IAT
2008
IEEE
14 years 1 months ago
Bargaining in Markets with One-Sided Competition: Model and Analysis
The automation of agents that bargain within markets is a challenging open problem. In these settings a seller agent can take advantage from the competition among several buyer ag...
Nicola Gatti
IJCV
2008
102views more  IJCV 2008»
13 years 7 months ago
Modeling the World from Internet Photo Collections
Abstract There are billions of photographs on the Internet, comprising the largest and most diverse photo collection ever assembled. How can computer vision researchers exploit thi...
Noah Snavely, Steven M. Seitz, Richard Szeliski