Sciweavers

4171 search results - page 454 / 835
» Choice numbers of graphs
Sort
View
MST
2010
107views more  MST 2010»
15 years 5 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
KDD
2004
ACM
118views Data Mining» more  KDD 2004»
16 years 7 months ago
Parallel computation of high dimensional robust correlation and covariance matrices
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
James Chilson, Raymond T. Ng, Alan Wagner, Ruben H...
GLOBECOM
2008
IEEE
16 years 1 months ago
A Theory-Driven Distribution Algorithm for Peer-to-Peer Real Time Streaming
—Many distribution algorithms have been proposed up to now for P2P real time streaming. However, due to the lack of basic theoretical results and bounds, common sense and intuiti...
Lorenzo Bracciale, Francesca Lo Piccolo, Dario Luz...
WSNA
2003
ACM
16 years 2 days ago
Analyzing and modeling encryption overhead for sensor network nodes
Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in...
Prasanth Ganesan, Ramnath Venugopalan, Pushkin Ped...