Sciweavers

126 search results - page 15 / 26
» A dependence maximization view of clustering
Sort
View
AUSAI
2007
Springer
14 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
14 years 1 months ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 1 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
IJCAI
2003
13 years 9 months ago
Query rewriting and answering under constraints in data integration systems
In this paper we address the problem of query answering and rewriting in global-as-view data integration systems, when key and inclusion dependencies are expressed on the global i...
Andrea Calì, Domenico Lembo, Riccardo Rosat...
NIPS
2003
13 years 9 months ago
Design of Experiments via Information Theory
We discuss an idea for collecting data in a relatively efficient manner. Our point of view is Bayesian and information-theoretic: on any given trial, we want to adaptively choose...
Liam Paninski