Sciweavers

2208 search results - page 337 / 442
» Memory Practices in the Sciences
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 10 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 7 months ago
On the Comparison of Relative Clustering Validity Criteria.
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
Lucas Vendramin, Ricardo J. G. B. Campello, Eduard...
SDM
2009
SIAM
185views Data Mining» more  SDM 2009»
14 years 7 months ago
Understanding Importance of Collaborations in Co-authorship Networks: A Supportiveness Analysis Approach.
Co-authorship networks, an important type of social networks, have been studied extensively from various angles such as degree distribution analysis, social community extraction a...
Bin Zhou 0002, Jian Pei, Yan Jia, Yi Han
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
14 years 7 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila