3894 search results - page 531 / 779 » Approximation Algorithms for Biclustering Problems |
112
click to vote
NIPS
2003
15 years 5 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
134
click to vote
WISEC
2009
ACM
15 years 10 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
159
Voted
STOC
2005
ACM
15 years 9 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
118
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
115
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...