400 search results - page 12 / 80 » Derandomization and Distinguishing Complexity |
93
Voted
JAPLL
2010
14 years 6 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
114
Voted
AAAI
2007
15 years 2 months ago
2007
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
146
click to vote
PCM
2010
Springer
14 years 9 months ago
2010
Springer
Particle filter (PF) based object tracking methods have been widely used in computer vision. However, traditional particle filter trackers cannot effectively distinguish the target...
87
Voted
SAS
1991
Springer
15 years 3 months ago
1991
Springer
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
APAL
2008
14 years 11 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...