Sciweavers

10293 search results - page 150 / 2059
» Describing Semistructured Data
Sort
View
133
Voted
CACM
2010
117views more  CACM 2010»
15 years 4 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
CJ
1998
118views more  CJ 1998»
15 years 4 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
114
Voted
ICANNGA
2007
Springer
153views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
Automatic Design of ANNs by Means of GP for Data Mining Tasks: Iris Flower Classification Problem
This paper describes a new technique for automatically developing Artificial Neural Networks (ANNs) by means of an Evolutionary Computation (EC) tool, called Genetic Programming (G...
Daniel Rivero, Juan R. Rabuñal, Julian Dora...
149
Voted
WACV
2005
IEEE
15 years 10 months ago
Patchlets: Representing Stereo Vision Data with Surface Elements
This paper describes a class of augmented surface elements which we call patchlets. Patchlets are planar surface elements generated from dense stereo vision 3D range images. Patch...
Don Murray, James J. Little
SIGIR
2003
ACM
15 years 9 months ago
Modeling annotated data
We consider the problem of modeling annotated data—data with multiple types where the instance of one type (such as a caption) serves as a description of the other type (such as...
David M. Blei, Michael I. Jordan