Sciweavers

4860 search results - page 541 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
KAIS
2010
139views more  KAIS 2010»
15 years 3 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
ICCV
2007
IEEE
16 years 6 months ago
Supervised Learning of Image Restoration with Convolutional Networks
Convolutional networks have achieved a great deal of success in high-level vision problems such as object recognition. Here we show that they can also be used as a general method ...
Viren Jain, Joseph F. Murray, Fabian Roth, Sriniva...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 4 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
POPL
2010
ACM
15 years 11 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
PODC
2005
ACM
15 years 10 months 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