Sciweavers

3946 search results - page 9 / 790
» The computational complexity of choice sets
Sort
View
DCC
2002
IEEE
14 years 9 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
EDOC
2008
IEEE
13 years 11 months ago
A Model Driven Approach to Represent Sequence Diagrams as Free Choice Petri Nets
Model Driven Development (MDD) aims to promote the role of modeling in Software Engineering. Enterprise systems and architectures are often modeled via multiple representations. F...
Mohamed Ariff Ameedeen, Behzad Bordbar
ACL
1998
13 years 11 months ago
How Verb Subcategorization Frequencies Are Affected By Corpus Choice
The probabilistic relation between verbs and their arguments plays an important role in modern statistical parsers and supertaggers, and in psychological theories of language proc...
Douglas Roland, Daniel Jurafsky
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 10 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ICPP
2000
IEEE
14 years 2 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary