A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Coupling the periodic time-invariance of the wavelet transform with the view of thresholding as a projection yields a simple, recursive, wavelet-based technique for denoising sign...
Alyson K. Fletcher, Vivek K. Goyal, Kannan Ramchan...
Today many workers spend too much of their time translating their co-workers' requests into structures that information systems can understand. This paper presents the novel ...
John Zimmerman, Anthony Tomasic, Isaac Simmons, Ia...
— Many applications offer a form-based environment for na¨ıve users for accessing databases without being familiar with the database schema or a structured query language. User...
Alkis Simitsis, Georgia Koutrika, Yannis E. Ioanni...
As the amount of available silicon resources on one chip increases, we have seen the advent of ever increasing parallel resources integrated on-chip. Many architectures use these ...