1568 search results - page 146 / 314 » The problem of examination questions in algorithmics |
123
click to vote
MVA
2007
15 years 6 months ago
2007
The problem of planning the Next Best View (NBV) still poses many questions. However, the achieved methods and algorithms are hard to compare, since researchers use their own test...
139
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
168
click to vote
ECCC
2010
15 years 4 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
166
click to vote
ESORICS
2011
Springer
14 years 4 months ago
2011
Springer
The rapid progress of human genome studies leads to a strong demand of aggregate human DNA data (e.g, allele frequencies, test statistics, etc.), whose public dissemination, howeve...
151
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...