7015 search results - page 194 / 1403 » Approximation algorithms for co-clustering |
146
click to vote
CRYPTO
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
203
click to vote
TAMC
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
127
click to vote
ISSAC
2005
Springer
15 years 12 months ago
2005
Springer
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
160
click to vote
INFOCOM
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
152
click to vote
ADC
2006
Springer
16 years 13 days ago
2006
Springer
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...