3341 search results - page 393 / 669 » On Bounded Queries and Approximation |
172
click to vote
CADE
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
174
click to vote
JAPLL
2010
15 years 5 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
297
click to vote
CRV
2011
IEEE
14 years 6 months ago
2011
IEEE
—We present an algorithm that finds the rotation which best aligns a given configuration of directions on an unsorted set of directions. Using a cost function that we derive in...
173
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
195
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...