8695 search results - page 34 / 1739 » Making the Complex Simple |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
VISUALIZATION
2003
IEEE
14 years 1 months ago
2003
IEEE
There are numerous algorithms in graphics and visualization whose performance is known to decay as the topological complexity of the input increases. On the other hand, the standa...
IPTPS
2003
Springer
14 years 1 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible Logic ...