Sciweavers

724 search results - page 138 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
DCC
2004
IEEE
15 years 11 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
IWCMC
2010
ACM
15 years 1 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
POPL
2006
ACM
15 years 12 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
SIGMOD
2009
ACM
120views Database» more  SIGMOD 2009»
15 years 12 months ago
Kernel-based skyline cardinality estimation
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...
Zhenjie Zhang, Yin Yang, Ruichu Cai, Dimitris Papa...
VLSISP
2008
100views more  VLSISP 2008»
14 years 11 months ago
Memory-constrained Block Processing for DSP Software Optimization
Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded ...
Ming-Yung Ko, Chung-Ching Shen, Shuvra S. Bhattach...