Sciweavers

973 search results - page 102 / 195
» New Bounds on Crossing Numbers
Sort
View
BIRTHDAY
1997
Springer
15 years 10 months ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler
EUROCRYPT
2006
Springer
15 years 10 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
FUIN
2006
139views more  FUIN 2006»
15 years 6 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
EOR
2007
82views more  EOR 2007»
15 years 6 months ago
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha
CAGD
2004
76views more  CAGD 2004»
15 years 6 months ago
Mesh quality improvement and other properties in the four-triangles longest-edge partition
The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the t...
Angel Plaza, José P. Suárez, Miguel ...