Sciweavers

1670 search results - page 282 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
CIDR
2003
164views Algorithms» more  CIDR 2003»
15 years 3 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
BMCBI
2008
123views more  BMCBI 2008»
15 years 2 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
INFOCOM
2000
IEEE
15 years 6 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
TIT
2008
73views more  TIT 2008»
15 years 1 months ago
L-CAMP: Extremely Local High-Performance Wavelet Representations in High Spatial Dimension
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
Youngmi Hur, Amos Ron
CVPR
2012
IEEE
13 years 4 months ago
Weakly supervised structured output learning for semantic segmentation
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
Alexander Vezhnevets, Vittorio Ferrari, Joachim M....