Sciweavers

1458 search results - page 139 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
DCC
2002
IEEE
16 years 5 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
HICSS
2003
IEEE
140views Biometrics» more  HICSS 2003»
15 years 11 months ago
The Effects of Time and Personality on the Productivity of Management Information Systems
The paper studies the relationship between information technology (IT), time personality and managerial productivity. Time personality is captured by concepts of polychronicity an...
Vladimir Kvassov
SDM
2008
SIAM
206views Data Mining» more  SDM 2008»
15 years 7 months ago
Latent Variable Mining with Its Applications to Anomalous Behavior Detection
In this paper, we propose a new approach to anomaly detection by looking at the latent variable space to make the first step toward latent anomaly detection. Most conventional app...
Shunsuke Hirose, Kenji Yamanishi
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 3 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
IWPC
2009
IEEE
16 years 25 days ago
Intensions are a key to program comprehension
The classical comprehension theories study relations between extensions, intensions, and names. Originally developed in linguistics and mathematics, these theories are applicable ...
Václav Rajlich