Sciweavers

141 search results - page 9 / 29
» Destruction of Very Simple Trees
Sort
View
FOCS
1989
IEEE
13 years 11 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
ADHOC
2005
116views more  ADHOC 2005»
13 years 7 months ago
Power efficient routing trees for ad hoc wireless networks using directional antenna
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Fei Dai, Qing Dai, Jie Wu
ICIP
2000
IEEE
14 years 9 months ago
Multichannel Image Compression by Bijection Mappings onto Zero-Trees
A new approach to multichannel image compression is introduced where the intra- and cross-band correlations are jointly exploited in a surprisingly simple yet very effective manner...
José L. Paredes, Gonzalo R. Arce, Leonard E...
IPM
2008
159views more  IPM 2008»
13 years 7 months ago
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
Min Zhang, Guodong Zhou, AiTi Aw
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
13 years 8 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin