Sciweavers

357 search results - page 28 / 72
» Fast Hypergraph Partition
Sort
View
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 7 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
CASES
2004
ACM
13 years 11 months ago
Automatic data partitioning for the agere payload plus network processor
With the ever-increasing pervasiveness of the Internet and its stringent performance requirements, network system designers have begun utilizing specialized chips to increase the ...
Steve Carr, Philip H. Sweany
ICIP
2002
IEEE
14 years 9 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
HSNMC
2004
Springer
172views Multimedia» more  HSNMC 2004»
14 years 27 days ago
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao
APPINF
2003
13 years 9 months ago
Replication of Checkpoints in Recoverable DSM Systems
This paper presents a new technique of recovery for object-based Distributed Shared Memory (DSM) systems. The new technique, integrated with a coherence protocol for atomic consis...
Jerzy Brzezinski, Michal Szychowiak