Sciweavers

559 search results - page 84 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
CSCLP
2003
Springer
14 years 2 months ago
Experimental Evaluation of Interchangeability in Soft CSPs
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
DAWAK
2004
Springer
14 years 2 months ago
SCLOPE: An Algorithm for Clustering Data Streams of Categorical Attributes
Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose SCLOPE, a novel algorith...
Kok-Leong Ong, Wenyuan Li, Wee Keong Ng, Ee-Peng L...
ICASSP
2009
IEEE
14 years 3 months ago
Robust speech dereverberation based on non-negativity and sparse nature of speech spectrograms
This paper presents a blind dereverberation method designed to recover the subband envelope of an original speech signal from its reverberant version. The problem is formulated as...
Hirokazu Kameoka, Tomohiro Nakatani, Takuya Yoshio...
CPAIOR
2008
Springer
13 years 10 months ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
COMPSAC
1998
IEEE
14 years 1 months ago
Allocating Data Objects to Multiple Sites for Fast Browsing of Hypermedia Documents
Many world wide web applications require access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem