Sciweavers

666 search results - page 13 / 134
» The Pipelined Set Cover Problem
Sort
View
ICMCS
2008
IEEE
173views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Improvement of the embedding efficiency of LSB matching by sum and difference covering set
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
Xiaolong Li, Tieyong Zeng, Bin Yang
VISUALIZATION
1999
IEEE
14 years 3 hour ago
A Multi-Threaded Streaming Pipeline Architecture for Large Structured Data Sets
Computer simulation and digital measuring systems are now generating data of unprecedented size. The size of data is becoming so large that conventional visualization tools are in...
C. Charles Law, Ken Martin, William J. Schroeder, ...
FSTTCS
2009
Springer
14 years 2 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
14 years 2 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
DAC
1994
ACM
13 years 11 months ago
Synthesis of Instruction Sets for Pipelined Microprocessors
We present a systematic approach to synthesize an instruction set such that the given application software can be efficiently mapped to a parameterized, pipelined microarchitectur...
Ing-Jer Huang, Alvin M. Despain