Sciweavers

4965 search results - page 156 / 993
» A Simple Abstraction for Data Modeling
Sort
View
ECCC
2007
144views more  ECCC 2007»
15 years 6 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
15 years 12 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
Filippo Geraci, Roberto Grossi
INFOCOM
2003
IEEE
15 years 11 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid
IJFCS
2006
108views more  IJFCS 2006»
15 years 6 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
CORR
2002
Springer
180views Education» more  CORR 2002»
15 years 6 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer