Results 1  10
of
7,027
Knowledgebased Analysis of Microarray Gene Expression Data By Using Support Vector Machines
, 2000
"... We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge of ..."
Abstract

Cited by 520 (8 self)
 Add to MetaCart
of gene function to identify unknown genes of similar function from expression data. SVMs avoid several problems associated with unsupervised clustering methods, such as hierarchical clustering and selforganizing maps. SVMs have many mathematical features that make them attractive for gene expression
Narrow Filtered DPSK: an Attractive Solution for Hybrid Systems
"... Abstract We propose an efficient Hybrid system based on 40G DQPSK and 10G narrow filter DPSK in place of ..."
Abstract
 Add to MetaCart
Abstract We propose an efficient Hybrid system based on 40G DQPSK and 10G narrow filter DPSK in place of
A Singular Value Thresholding Algorithm for Matrix Completion
, 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract

Cited by 555 (22 self)
 Add to MetaCart
toimplement algorithm that is extremely efficient at addressing problems in which the optimal solution has low rank. The algorithm is iterative and produces a sequence of matrices {X k, Y k} and at each step, mainly performs a softthresholding operation on the singular values of the matrix Y k. There are two
A densitybased algorithm for discovering clusters in large spatial databases with noise
, 1996
"... Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clu ..."
Abstract

Cited by 1786 (70 self)
 Add to MetaCart
Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery
On active contour models and balloons
 CVGIP: Image
"... The use.of energyminimizing curves, known as “snakes, ” to extract features of interest in images has been introduced by Kass, Witkhr & Terzopoulos (Znt. J. Comput. Vision 1, 1987,321331). We present a model of deformation which solves some of the problems encountered with the original method. ..."
Abstract

Cited by 588 (43 self)
 Add to MetaCart
. The external forces that push the curve to the edges are modified to give more stable results. The original snake, when it is not close enough to contours, is not attracted by them and straightens to a line. Our model makes the curve behave like a balloon which is inflated by an additional force. The initial
ModelDriven Data Acquisition in Sensor Networks
 IN VLDB
, 2004
"... Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor ..."
Abstract

Cited by 449 (36 self)
 Add to MetaCart
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor
Globally and locally attractive solutions for quasiperiodically forced systems
 J. Math. Anal. Appl
"... We consider a class of differential equations, x ̈ + γx ̇ + g(x) = f(ωt), with ω ∈ Rd, describing onedimensional dissipative systems subject to a periodic or quasiperiodic (Diophantine) forcing. We study existence and properties of trajectories with the same quasiperiodicity as the forcing. For ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
We consider a class of differential equations, x ̈ + γx ̇ + g(x) = f(ωt), with ω ∈ Rd, describing onedimensional dissipative systems subject to a periodic or quasiperiodic (Diophantine) forcing. We study existence and properties of trajectories with the same quasiperiodicity as the forcing. For g(x) = x2p+1, p ∈ N, we show that, when the dissipation coefficient is large enough, there is only one such trajectory and that it describes a global attractor. In the case of more general nonlinearities, including g(x) = x2 (describing the varactor equation), we find that there is at least one trajectory which describes a local attractor. 1
Uniformly attracting solutions of nonautonomous differential equations, Nonlinear Anal
, 2008
"... Abstract Understanding the structure of attractors is fundamental in nonautonomous stability and bifurcation theory. By means of clarifying theorems and carefully designed examples we highlight the potential complexity of attractors for nonautonomous differential equations that are as close to auto ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
to autonomous equations as possible. We introduce and study bounded uniform attractors and repellors for nonautonomous scalar differential equations, in particular for asymptotically autonomous, polynomial, and periodic equations. Our results suggest that uniformly attracting or repelling solutions are the true
DISCRETE AND CONTINUOUS COUNTING UNIFORMLY ATTRACTING SOLUTIONS OF NONAUTONOMOUS DIFFERENTIAL EQUATIONS
"... Abstract. Bounded uniform attractors and repellors are the natural nonautonomous analogues of autonomous stable and unstable equilibria. Unlike for equilibria, it is generally a difficult dynamical task to determine the number of uniformly attracting or repelling solutions for a given nonautonomous ..."
Abstract
 Add to MetaCart
Abstract. Bounded uniform attractors and repellors are the natural nonautonomous analogues of autonomous stable and unstable equilibria. Unlike for equilibria, it is generally a difficult dynamical task to determine the number of uniformly attracting or repelling solutions for a given
On the Existence of Locally Attractive Solutions of a Nonlinear Quadratic Volterra Integral Equation of Fractional Order
"... The authors employs a hybrid fixed point theorem involving the multiplication of two operators for proving an existence result of locally attractive solutions of a nonlinear quadratic Volterra integral equation of fractional arbitrary order. Investigations will be carried out in the Banach space of ..."
Abstract
 Add to MetaCart
The authors employs a hybrid fixed point theorem involving the multiplication of two operators for proving an existence result of locally attractive solutions of a nonlinear quadratic Volterra integral equation of fractional arbitrary order. Investigations will be carried out in the Banach space
Results 1  10
of
7,027