Sciweavers

815 search results - page 70 / 163
» Approximate Entropy Reducts
Sort
View
ICML
2002
IEEE
16 years 21 days ago
A New Statistical Approach to Personal Name Extraction
We propose a new statistical approach to extracting personal names from a corpus. One of the key points of our approach is that it can both automatically learn the characteristics...
Zheng Chen, Liu Wenyin, Feng Zhang
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
15 years 6 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
IPL
2011
73views more  IPL 2011»
14 years 6 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa
ICASSP
2009
IEEE
15 years 6 months ago
Separable PCA for image classification
As an alternative to standard PCA, matrix-based image dimensionality reduction methods have recently been proposed and have gained attention due to reported computational efficie...
Yongxin Taylor Xi, Peter J. Ramadge
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 6 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips