340 search results - page 58 / 68 » ets 2009 |
99
Voted
SODA
2012
ACM
13 years 17 days ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
115
click to vote
INLG
2010
Springer
14 years 8 months ago
2010
Springer
The generation of referring expressions (GRE), an important subtask of Natural Language Generation (NLG) is to generate phrases that uniquely identify domain entities. Until recen...
SIGECOM
2010
ACM
15 years 3 months ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
125
click to vote
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
INFORMATICALT
2010
14 years 8 months ago
2010
In the previous papers (Pupeikis, 2000; Genov et al., 2006; Atanasov and Pupeikis, 2009), a direct approach for estimating the parameters of a discrete-time linear time-invariant (...