Sciweavers

11211 search results - page 1832 / 2243
» Rank-Sensitive Data Structures
Sort
View
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
16 years 4 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
16 years 4 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
351
Voted
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 4 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 1 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
PLPV
2009
ACM
16 years 1 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
« Prev « First page 1832 / 2243 Last » Next »