Sciweavers

363 search results - page 23 / 73
» Partial Multicuts in Trees
Sort
View
ICN
2005
Springer
14 years 3 months ago
Scalable Group Key Management with Partially Trusted Controllers
Abstract. Scalable group key management solutions are crucial for supporting Internet applications that are based on a group communication model. Many solutions have been proposed ...
Himanshu Khurana, Rafael Bonilla, Adam J. Slagell,...
PDP
2010
IEEE
14 years 3 months ago
Load Balancing Algorithms with Partial Information Management for the DLML Library
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...
Juan Santana-Santana, Miguel A. Castro-Garcí...
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
14 years 11 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...
ICML
1999
IEEE
14 years 10 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
IPL
2006
87views more  IPL 2006»
13 years 9 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski