217 search results - page 43 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
94
Voted
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
PDPTA
2004
14 years 11 months ago
2004
Abstract Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly comp...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...