Sciweavers

22128 search results - page 4211 / 4426
» Research in Structural Computing
Sort
View
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 4 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
MOBIHOC
2009
ACM
16 years 4 months ago
Energy-efficient capture of stochastic events by global- and local-periodic network coverage
We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset...
Shibo He, Jiming Chen, David K. Y. Yau, Huanyu Sha...
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
16 years 4 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
KDD
2004
ACM
108views Data Mining» more  KDD 2004»
16 years 4 months ago
Sleeved coclustering
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...
Avraham A. Melkman, Eran Shaham
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 4 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
« Prev « First page 4211 / 4426 Last » Next »