Sciweavers

1200 search results - page 240 / 240
» Marked Ancestor Problems
Sort
View
TSP
2010
13 years 5 hour ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
ASPLOS
2011
ACM
12 years 9 months ago
Sponge: portable stream programming on graphics engines
Graphics processing units (GPUs) provide a low cost platform for accelerating high performance computations. The introduction of new programming languages, such as CUDA and OpenCL...
Amir Hormati, Mehrzad Samadi, Mark Woh, Trevor N. ...
CVPR
2012
IEEE
11 years 7 months ago
Recovering free space of indoor scenes from a single image
In this paper we consider the problem of recovering the free space of an indoor scene from its single image. We show that exploiting the box like geometric structure of furniture ...
Varsha Hedau, Derek Hoiem, David A. Forsyth
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 5 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
BMCBI
2006
72views more  BMCBI 2006»
13 years 5 months ago
Selecting effective siRNA sequences by using radial basis function network and decision tree learning
Background: Although short interfering RNA (siRNA) has been widely used for studying gene functions in mammalian cells, its gene silencing efficacy varies markedly and there are o...
Shigeru Takasaki, Yoshihiro Kawamura, Akihiko Kona...