Sciweavers

RANDOM
1998
Springer
14 years 2 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
ICCAD
1997
IEEE
66views Hardware» more  ICCAD 1997»
14 years 2 months ago
Sequential optimisation without state space exploration
We propose an algorithm for area optimisation of sequential circuits through redundancy removal. The algorithm finds compatible redundancies by implying values over nets in the c...
Amit Mehrotra, Shaz Qadeer, Vigyan Singhal, Robert...
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
14 years 2 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
DEXAW
1997
IEEE
77views Database» more  DEXAW 1997»
14 years 2 months ago
A Per-object Based Hybrid Concurrency Control
Existing concurrency control algorithms do not well conform to various environments, in the performance perspective. Each algorithm has some assumption on the conflict characteris...
Tae-Young Kwak, Yoon-Joon Lee, Myoung-Ho Kim
CVPR
1997
IEEE
14 years 2 months ago
Physically based fluid flow recovery from image sequences
This paper presents an approach to measuring fluid flow from image sequences. The approach centers around a motion recovery algorithm that is based on principles from fluid mechan...
Richard P. Wildes, Michael J. Amabile, Ann-Marie L...
ATS
1997
IEEE
89views Hardware» more  ATS 1997»
14 years 2 months ago
Guaranteeing Testability in Re-encoding for Low Power
This paper considers the testability implications of low power design methodologies. Low power and high testability are shown to be highly contrasting requirements, and an optimiz...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mau...
FPGA
1998
ACM
160views FPGA» more  FPGA 1998»
14 years 2 months ago
A New Retiming-Based Technology Mapping Algorithm for LUT-based FPGAs
In this paper, we present a new retiming-based technology mapping algorithm for look-up table-based eld programmable gate arrays. The algorithm is based on a novel iterative proce...
Peichen Pan, Chih-Chang Lin
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
14 years 2 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
SIGIR
1998
ACM
14 years 2 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
SIGGRAPH
1998
ACM
14 years 2 months ago
A New Voronoi-based Surface Reconstruction Algorithm
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
Nina Amenta, Marshall W. Bern, Manolis Kamvysselis