Sciweavers

12459 search results - page 271 / 2492
» cans 2006
Sort
View
JCO
2006
153views more  JCO 2006»
15 years 6 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
JCP
2006
102views more  JCP 2006»
15 years 6 months ago
Efficient Formulations for 1-SVM and their Application to Recommendation Tasks
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
Yasutoshi Yajima, Tien-Fang Kuo
JCRD
2006
71views more  JCRD 2006»
15 years 6 months ago
Feature Preserving Mesh Simplification Based on Corner Cutting
Abstract Most of the existing algorithms for simplifying triangular meshes might lose some important shape features of the original model, especially at low levels of the simplifie...
Zhongping Ji, Ligang Liu, Guojin Wang
JCS
2006
118views more  JCS 2006»
15 years 6 months ago
Enforcing Robust Declassification and Qualified Robustness
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems release sensitive information as part of their in...
Andrew C. Myers, Andrei Sabelfeld, Steve Zdancewic
JCT
2006
67views more  JCT 2006»
15 years 6 months ago
On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs
We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...
Malcolm Greig, Harri Haanpää, Petteri Ka...