Sciweavers

410 search results - page 63 / 82
» Objective and Subjective Algorithms for Grouping Association...
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
INFOCOM
2010
IEEE
13 years 6 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
WWW
2006
ACM
14 years 8 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
KDD
2008
ACM
234views Data Mining» more  KDD 2008»
14 years 8 months ago
Angle-based outlier detection in high-dimensional data
Detecting outliers in a large set of data objects is a major data mining task aiming at finding different mechanisms responsible for different groups of objects in a data set. All...
Hans-Peter Kriegel, Matthias Schubert, Arthur Zime...
CIKM
2005
Springer
14 years 1 months ago
Privacy leakage in multi-relational databases via pattern based semi-supervised learning
In multi-relational databases, a view, which is a context- and content-dependent subset of one or more tables (or other views), is often used to preserve privacy by hiding sensiti...
Hui Xiong, Michael Steinbach, Vipin Kumar