Sciweavers

12519 search results - page 2186 / 2504
» Approximation Problems Categories
Sort
View
MM
2005
ACM
140views Multimedia» more  MM 2005»
16 years 7 days ago
Web image clustering by consistent utilization of visual features and surrounding texts
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...
Bin Gao, Tie-Yan Liu, Tao Qin, Xin Zheng, QianShen...
PLDI
2005
ACM
16 years 7 days ago
TraceBack: first fault diagnosis by reconstruction of distributed control flow
Faults that occur in production systems are the most important faults to fix, but most production systems lack the debugging facilities present in development environments. TraceB...
Andrew Ayers, Richard Schooler, Chris Metcalf, Ana...
PODC
2005
ACM
16 years 7 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
PODC
2005
ACM
16 years 7 days ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
SBCCI
2005
ACM
98views VLSI» more  SBCCI 2005»
16 years 7 days ago
Mapping embedded systems onto NoCs: the traffic effect on dynamic energy estimation
This work addresses the problem of application mapping in networks-on-chip (NoCs). It explores the importance of characterizing network traffic to effectively predict NoC energy c...
José Carlos S. Palma, César A. M. Ma...
« Prev « First page 2186 / 2504 Last » Next »