Sciweavers

1486 search results - page 161 / 298
» Algorithms for two-box covering
Sort
View
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 9 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
FOCS
2004
IEEE
15 years 8 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
LREC
2008
120views Education» more  LREC 2008»
15 years 5 months ago
JMWNL: an Extensible Multilingual Library for Accessing Wordnets in Different Languages
In this paper we present JMWNL, a multilingual extension of the JWNL java library, which was originally developed for accessing Princeton WordNet dictionaries. JMWNL broadens the ...
Maria Teresa Pazienza, Armando Stellato, Alexandra...
SEC
2008
15 years 5 months ago
Detecting More SIP Attacks on VoIP Services by Combining Rule Matching and State Transition Models
The Session Initiation Protocol (SIP) has been used widely for Voice over IP (VoIP) service because of its potential advantages, economical efficiency and call setup simplicity. Ho...
Dongwon Seo, Heejo Lee, Ejovi Nuwere
AHSWN
2008
92views more  AHSWN 2008»
15 years 4 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal