10988 search results - page 2044 / 2198 » Algorithmic Folding Complexity |
156
Voted
DAGSTUHL
2007
15 years 4 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
155
Voted
EUSFLAT
2007
15 years 4 months ago
2007
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...
139
Voted
EON
2008
15 years 4 months ago
2008
Abstract. In this paper we show how to apply a tableau-based software composition technique to automatically generate the mediator's service logic. This uses an LTL planning (...
201
click to vote
NIPS
2008
15 years 4 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
134
Voted
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
In many applications, we monitor data obtained from multiple streaming sources for collective decision making. The task presents several challenges. First, data in sensor networks...