Sciweavers

903 search results - page 94 / 181
» On the reduction of a random basis
Sort
View
VIS
2005
IEEE
122views Visualization» more  VIS 2005»
16 years 7 months ago
Effectively Visualizing Large Networks Through Sampling
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Davood Rafiei, Stephen Curial
ICCD
2008
IEEE
117views Hardware» more  ICCD 2008»
16 years 3 months ago
Two dimensional highly associative level-two cache design
High associativity is important for level-two cache designs [9]. Implementing CAM-based Highly Associative Caches (CAM-HAC), however, is both costly in hardware and exhibits poor s...
Chuanjun Zhang, Bing Xue
ASIACRYPT
2007
Springer
16 years 14 days ago
Miniature CCA2 PK Encryption: Tight Security Without Redundancy
ersion of an extended abstract to be published in Advances in Cryptology—ASIACRYPT 2007, Springer-Verlag, 2007. Available online from: http://www.cs.stanford.edu/∼xb/asiacrypt0...
Xavier Boyen
CIKM
2005
Springer
15 years 12 months ago
Joint deduplication of multiple record types in relational data
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
Aron Culotta, Andrew McCallum
BNCOD
2003
104views Database» more  BNCOD 2003»
15 years 7 months ago
External Sorting with On-the-Fly Compression
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
John Yiannis, Justin Zobel