Sciweavers

16404 search results - page 253 / 3281
» A set coverage problem
Sort
View
FLAIRS
2001
15 years 5 months ago
Tracking Clusters in Evolving Data Sets
As organizations accumulate data over time, the problem of tracking how patterns evolve becomes important. In this paper, we present an algorithm to track the evolution of cluster...
Daniel Barbará, Ping Chen
TCBB
2008
76views more  TCBB 2008»
15 years 4 months ago
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...
Michael D. Hendy, Sagi Snir
SIGPRO
2002
91views more  SIGPRO 2002»
15 years 4 months ago
Comparison of maximum entropy and minimal mutual information in a nonlinear setting
In blind source separation (BSS), two di erent separation techniques are mainly used: minimal mutual information (MMI), where minimization of the mutual output information yields ...
Fabian J. Theis, Christoph Bauer, Elmar Wolfgang L...
SMC
2010
IEEE
121views Control Systems» more  SMC 2010»
15 years 2 months ago
Learning of personalized security settings
—While many cybersecurity tools are available to computer users, their default configurations often do not match needs of specific users. Since most modern users are not computer...
Mehrbod Sharifi, Eugene Fink, Jaime G. Carbonell
ICML
2005
IEEE
16 years 5 months ago
Implicit surface modelling as an eigenvalue problem
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
Christian Walder, Olivier Chapelle, Bernhard Sch&o...