Sciweavers

736 search results - page 131 / 148
» Approximating the Number of Network Motifs
Sort
View
SIGMETRICS
2000
ACM
153views Hardware» more  SIGMETRICS 2000»
15 years 2 months ago
Measurement and analysis of LDAP performance
The Lightweight Directory Access Protocol (LDAP) is being used for an increasing number of distributed directory applications. We describe a tool to analyze the performance of LDA...
Xin Wang, Henning Schulzrinne, Dilip D. Kandlur, D...
ICIP
1998
IEEE
15 years 2 months ago
Multiple-Description Wavelet based Image Coding
Abstract--We consider the problem of coding images for transmission over error-prone channels. The impairments we target are transient channel shutdowns, as would occur in a packet...
Sergio D. Servetto, Kannan Ramchandran, Vinay A. V...
ECML
2006
Springer
15 years 1 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
COMPGEOM
2001
ACM
15 years 1 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 1 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis