1161 search results - page 105 / 233 » Kinetic Dependence Graphs |
93
Voted
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
109
click to vote
TKDE
2008
15 years 16 days ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
124
click to vote
TCBB
2010
14 years 7 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
ASPLOS
2004
ACM
15 years 6 months ago
2004
ACM
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can r...
ICCV
2005
IEEE
16 years 2 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...