Sciweavers

124 search results - page 18 / 25
» The Path Length of Binary Trees
Sort
View
IANDC
2008
92views more  IANDC 2008»
14 years 11 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
100
Voted
PR
2008
206views more  PR 2008»
14 years 11 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
JAL
2002
113views more  JAL 2002»
14 years 11 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
69
Voted
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
15 years 6 months ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu