2365 search results - page 290 / 473 » All things are connected |
161
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
149
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
184
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
166
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Internet includes thousands of Internet service providers (ISPs) which are interconnected to provide connectivity and service for end-users. Traditionally, the settlement b...
189
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
In recent years, co-clustering has emerged as a powerful data mining tool that can analyze dyadic data connecting two entities. However, almost all existing co-clustering techniqu...