Sciweavers

870 search results - page 152 / 174
» Constructions for Difference Triangle Sets
Sort
View
INFOCOM
1998
IEEE
13 years 11 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol
COCOON
1998
Springer
13 years 11 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
ANCS
2006
ACM
13 years 11 months ago
Efficient memory utilization on network processors for deep packet inspection
Deep Packet Inspection (DPI) refers to examining both packet header and payload to look for predefined patterns, which is essential for network security, intrusion detection and c...
Piti Piyachon, Yan Luo
ISMB
1997
13 years 9 months ago
Standardized Representations of the Literature: Combining Diverse Sources of Ribosomal Data
We are building a knowledge base (KB) of published structural data on the 30s ribosomal subunit in prokaryotes. Our KB is distinguished by a standardized representation of biologi...
Russ B. Altman, Neil F. Abernethy, Richard O. Chen
BMCBI
2010
137views more  BMCBI 2010»
13 years 7 months ago
Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
Michael L. Sierk, Michael E. Smoot, Ellen J. Bass,...