Sciweavers

328 search results - page 8 / 66
» Are You Being Served
Sort
View
KDD
2002
ACM
1075views Data Mining» more  KDD 2002»
14 years 8 months ago
CLOPE: a fast and effective clustering algorithm for transactional data
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
Yiling Yang, Xudong Guan, Jinyuan You
CACM
2010
117views more  CACM 2010»
13 years 7 months ago
Computing arbitrary functions of encrypted data
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
Craig Gentry
AGILEDC
2007
IEEE
14 years 1 months ago
A Strategy for Balancing Business Value and Story Size
What would your Analyst team do when torn between meeting Customer versus Developer demands? When their needs conflict with one another, how do you appease them both? The report o...
Hai Ton
SEMWEB
2007
Springer
14 years 1 months ago
DBpedia: A Nucleus for a Web of Open Data
Abstract DBpedia is a community effort to extract structured information from Wikipedia and to make this information available on the Web. DBpedia allows you to ask sophisticated ...
Sören Auer, Christian Bizer, Georgi Kobilarov...
SADFE
2010
IEEE
13 years 5 months ago
Fonts for Forensics
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
Fred Cohen