Sciweavers

1538 search results - page 289 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICDE
2010
IEEE
258views Database» more  ICDE 2010»
14 years 5 months ago
Anonymized Data: Generation, models, usage
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...
Graham Cormode, Divesh Srivastava
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 4 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
COMPGEOM
2006
ACM
14 years 4 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
INFOVIS
2002
IEEE
14 years 3 months ago
Visualizing Data with Bounded Uncertainty
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
Chris Olston, Jock D. Mackinlay
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
14 years 2 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli