Sciweavers

1951 search results - page 360 / 391
» An algorithm for improving graph partitions
Sort
View
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
14 years 4 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
ICMCS
2000
IEEE
89views Multimedia» more  ICMCS 2000»
15 years 2 months ago
Reducing Bandwidth Requirement for Delivering Video over Wide Area Networks with Proxy Server
Abstract—Due to the high bandwidth requirement and rate variability of compressed video, delivering video across wide area networks (WANs) is a challenging issue. Proxy servers h...
Wei-hsiu Ma, David Hung-Chang Du
ENTCS
2006
163views more  ENTCS 2006»
14 years 10 months ago
Design Challenges for a Differential-Power-Analysis Aware GALS-based AES Crypto ASIC
In recent years several successful GALS realizations have been presented. The core of a GALS system is a locally synchronous island that is designed using industry standard synchr...
Frank K. Gürkaynak, Stephan Oetiker, Hubert K...
VLSISP
2008
100views more  VLSISP 2008»
14 years 10 months ago
Memory-constrained Block Processing for DSP Software Optimization
Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded ...
Ming-Yung Ko, Chung-Ching Shen, Shuvra S. Bhattach...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau