Sciweavers

2434 search results - page 201 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
VL
2003
IEEE
134views Visual Languages» more  VL 2003»
15 years 9 months ago
End-user programming as translation: an experimental framework and study
One of the reputed advantages of end-user programming languages is that they support a given problem doh a set of programming abstractions that are “just right” for the end-us...
Christopher D. Hundhausen, Ravikiran Vatrapu, Josh...
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 8 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
131
Voted
TWC
2008
177views more  TWC 2008»
15 years 4 months ago
Generalized Design of Multi-User MIMO Precoding Matrices
In this paper we introduce a novel linear precoding technique. The approach used for the design of the precoding matrix is general and the resulting algorithm can address several o...
Veljko Stankovic, Martin Haardt
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
KAIS
2000
86views more  KAIS 2000»
15 years 3 months ago
A Mathematical Foundation for Improved Reduct Generation in Information Systems
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
Janusz A. Starzyk, Dale E. Nelson, Kirk Sturtz