Sciweavers

2157 search results - page 117 / 432
» Binary ant algorithm
Sort
View
FOCS
2006
IEEE
15 years 6 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 4 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
VLSISP
2002
114views more  VLSISP 2002»
15 years 5 days ago
Image processing using cellular neural networks based on multi-valued and universal binary neurons
Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an a...
Igor N. Aizenberg, Constantine Butakoff
110
Voted
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
15 years 6 months ago
Minimization of memory size for heterogeneous MDDs
Abstract— In this paper, we propose exact and heuristic algorithms for minimizing the memory size for heterogeneous Multivalued Decision Diagrams (MDDs). In a heterogeneous MDD, ...
Shinobu Nagayama, Tsutomu Sasao
125
Voted
TIT
2010
300views Education» more  TIT 2010»
14 years 7 months ago
Polar codes are optimal for lossy source coding
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
Satish Babu Korada, Rüdiger L. Urbanke