Sciweavers

4488 search results - page 158 / 898
» Properties of NP-Complete Sets
Sort
View
IDA
2005
Springer
14 years 1 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
CC
2005
Springer
153views System Software» more  CC 2005»
14 years 1 months ago
Completeness Analysis for Incomplete Object-Oriented Programs
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Jingling Xue, Phung Hua Nguyen
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 9 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
COCOON
2010
Springer
14 years 1 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
DCC
2010
IEEE
14 years 3 months ago
On the Systematic Measurement Matrix for Compressed Sensing in the Presence of Gross Errors
Inspired by syndrome source coding using linear error-correcting codes, we explore a new form of measurement matrix for compressed sensing. The proposed matrix is constructed in t...
Zhi Li, Feng Wu, John Wright