3894 search results - page 642 / 779 » Approximation Algorithms for Biclustering Problems |
127
Voted
SIGMOD
1998
ACM
15 years 7 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
134
click to vote
EMMCVPR
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
125
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
164
Voted
COCOA
2009
Springer
15 years 7 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
148
Voted
APWEB
2006
Springer
15 years 7 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...