6274 search results - page 293 / 1255 » From query complexity to computational complexity |
157
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
171
Voted
PUC
2002
15 years 5 months ago
2002
One difficulty for interface design on mobile computers is lack of screen space caused by their small size. This paper describes a small pilot study and two formal experiments tha...
159
Voted
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
186
click to vote
ISSAC
2009
Springer
16 years 21 days ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
184
Voted
EUC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. A dramatic increase of event monitoring capabilities by wireless sensors requires new, more sophisticated, event correlation over time and space. This new paradigm implie...