Sciweavers

2200 search results - page 327 / 440
» Bloch's Constant is Computable
Sort
View
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 10 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
ICDE
1998
IEEE
139views Database» more  ICDE 1998»
15 years 10 months ago
Cost and Imprecision in Modeling the Position of Moving Objects
Consider a database that represents the location of moving objects, such as taxi-cabs (typical query: retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chica...
Ouri Wolfson, Sam Chamberlain, Son Dao, Liqin Jian...
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 10 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
ECOOP
1997
Springer
15 years 10 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
COMPGEOM
1996
ACM
15 years 10 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor