Sciweavers

663 search results - page 21 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
173
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 7 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
IAT
2009
IEEE
15 years 10 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
ICPR
2008
IEEE
15 years 10 months ago
Feature selection for clustering with constraints using Jensen-Shannon divergence
In semi-supervised clustering, domain knowledge can be converted to constraints and used to guide the clustering. In this paper we propose a feature selection algorithm for semi-s...
Yuanhong Li, Ming Dong, Yunqian Ma
134
Voted
SAC
2008
ACM
15 years 3 months ago
Expected energy consumption minimization in DVS systems with discrete frequencies
Energy-efficiency has been an important system issue in hardware and software designs to extend operation duration or cut power bills. This research explores systems with probabil...
Jian-Jia Chen
PSIVT
2009
Springer
130views Multimedia» more  PSIVT 2009»
15 years 10 months ago
Compact Fundamental Matrix Computation
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
Kenichi Kanatani, Yasuyuki Sugaya