Sciweavers

4451 search results - page 436 / 891
» On Random Ordering Constraints
Sort
View
ICML
2006
IEEE
16 years 7 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
ISBI
2004
IEEE
16 years 7 months ago
Non-Rigid Image Transformation for Assessing Changes in Fluorescence Imaging Data of Molecular Activity in Time-Dependent Geomet
This paper presents an image processing framework for assessing molecular activity changes from fluorescent data in time-dependent geometries. The aim of our work is to provide th...
Kostas Marias, Stelios C. Orphanoudakis, Jorge Rip...
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
16 years 7 months ago
Privacy Preserving OLAP
We present techniques for privacy-preserving computation of multidimensional aggregates on data partitioned across multiple clients. Data from different clients is perturbed (rand...
Rakesh Agrawal, Ramakrishnan Srikant, Dilys Thomas
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
16 years 1 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...
EVOW
2009
Springer
16 years 1 months ago
Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go
This paper presents a successful application of parallel (grid) coevolution applied to the building of an opening book (OB) in 9x9 Go. Known sayings around the game of Go are refou...
Pierre Audouard, Guillaume Chaslot, Jean-Baptiste ...