Sciweavers

16404 search results - page 688 / 3281
» A set coverage problem
Sort
View
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
13 years 9 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
ISORC
2008
IEEE
16 years 1 months ago
Efficient Resource Management for Game Server Hosting
This paper describes work to ease the resource allocation problem in the domain of game server hosting. A solution was sought that required no alteration to game server code and w...
Dan Martin, Aad P. A. van Moorsel, Graham Morgan
NOMS
2008
IEEE
16 years 1 months ago
Towards an efficient implementation of traceback mechanisms in autonomous systems
—One of the major problems due to denial of service attacks is the identification of fault packets. To resolve this problem, several IP traceback methods have been defined. In th...
Karima Boudaoud, F. LeBorgne
ROBOCUP
2004
Springer
101views Robotics» more  ROBOCUP 2004»
16 years 17 days ago
Navigation Controllability of a Mobile Robot Population
In this paper, the problem of determining if a population of mobile robots is able to travel from an initial conguration to a target conguration is addressed. This problem is rel...
Francisco A. Melo, M. Isabel Ribeiro, Pedro U. Lim...
FOCS
1999
IEEE
15 years 11 months ago
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
Piotr Indyk