2107 search results - page 123 / 422 » Computing Small Search Numbers in Linear Time |
172
click to vote
POPL
1996
ACM
15 years 10 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
143
click to vote
JSCIC
2006
2006
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
15 years 6 months ago
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
148
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
176
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
163
click to vote
CSR
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation p...