6274 search results - page 561 / 1255 » From query complexity to computational complexity |
181
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
162
click to vote
ANCS
2006
ACM
15 years 11 months ago
2006
ACM
As Intrusion Detection Systems (IDS) utilize more complex syntax to efficiently describe complex attacks, their processing requirements increase rapidly. Hardware and, even more, ...
173
click to vote
RT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present a new hybrid rendering method for interactive walkthroughs in photometrically complex environments. The display process starts from some approximation of the s...
172
click to vote
AAAI
2007
15 years 9 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
184
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...