Sciweavers

4894 search results - page 745 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 1 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
CP
2004
Springer
14 years 1 months ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet
ACSC
2003
IEEE
14 years 1 months ago
A Practical Method to Counteract Denial of Service Attacks
Today distributed denial of service (DDoS) attacks are causing major problems to conduct online business over the Internet. Recently several schemes have been proposed on how to p...
Udaya Kiran Tupakula, Vijay Varadharajan
ICCV
2003
IEEE
14 years 1 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
INFOCOM
2003
IEEE
14 years 1 months ago
Improving Web Performance in Broadcast-Unicast Networks
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Sriniv...