Sciweavers

680 search results - page 64 / 136
» A randomized embedding algorithm for trees
Sort
View
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
14 years 2 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
13 years 9 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
CSREASAM
2006
13 years 10 months ago
A New Robust and Secure Steganographic System for Greyscale Images
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...
Hesham Elzouka
PVLDB
2008
110views more  PVLDB 2008»
13 years 8 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons