Sciweavers

534 search results - page 55 / 107
» Efficient polynomial L-approximations
Sort
View
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
14 years 9 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
SMI
1999
IEEE
116views Image Analysis» more  SMI 1999»
14 years 4 days ago
Intersecting Surfaces of Special Types
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
Myung-Soo Kim
IPPS
1998
IEEE
14 years 3 days ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
FTP
1998
Springer
14 years 2 days ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt
SACRYPT
1998
Springer
173views Cryptology» more  SACRYPT 1998»
14 years 2 days ago
A Lattice-Based Public-Key Cryptosystem
In 1998, Cai and Cusick proposed a lattice-based public-key cryptosystem based on the similar ideas of the Ajtai-Dwork cryptosystem, but with much less data expansion. However, th...
Jin-yi Cai, Thomas W. Cusick