Sciweavers

676 search results - page 74 / 136
» A Search-Free Intersection Algorithm
Sort
View
DAM
2006
191views more  DAM 2006»
13 years 10 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
TVCG
2008
128views more  TVCG 2008»
13 years 10 months ago
AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
Anish Chandak, Christian Lauterbach, Micah T. Tayl...
TWC
2008
109views more  TWC 2008»
13 years 10 months ago
On Multiple Symbol Detection for Diagonal DUSTM Over Ricean Channels
This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available...
Tao Cui, Chintha Tellambura
NAR
2011
199views Computer Vision» more  NAR 2011»
13 years 25 days ago
RepTar: a database of predicted cellular targets of host and viral miRNAs
Computational identification of putative microRNA (miRNA) targets is an important step towards elucidating miRNA functions. Several miRNA target-prediction algorithms have been de...
Naama Elefant, Amnon Berger, Harel Shein, Matan Ho...
SPAA
1998
ACM
14 years 2 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller