Sciweavers

1554 search results - page 217 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
ECCV
2008
Springer
16 years 5 months ago
GeoS: Geodesic Image Segmentation
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
Antonio Criminisi, Toby Sharp, Andrew Blake
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
16 years 9 days ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
VTC
2007
IEEE
104views Communications» more  VTC 2007»
15 years 9 months ago
Subspace Tracking Based Blind MIMO Transmit Preprocessing
Abstract— In this contribution projection approximation subspace tracking using deflation (PASTD) is investigated in the context of MIMO transmit preprocessing systems by exploi...
Wei Liu, Lie-Liang Yang, Lajos Hanzo
VLDB
2007
ACM
125views Database» more  VLDB 2007»
15 years 9 months ago
Data Integration with Uncertainty
This paper reports our first set of results on managing uncertainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do...
Xin Luna Dong, Alon Y. Halevy, Cong Yu
FSTTCS
1993
Springer
15 years 7 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...