727 search results - page 17 / 146 » Private approximation of search problems |
ICCS
2009
Springer
14 years 5 months ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
ICDE
2006
IEEE
14 years 5 months ago
2006
IEEE
The spatio-temporal information of a video object is important for content-based video retrieval. In this paper the spatio-temporal information of a video object, such as the velo...
SIBGRAPI
2008
IEEE
14 years 5 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...