3359 search results - page 593 / 672 » A Simplified Idea Algorithm |
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
ICALP
2010
Springer
14 years 18 days ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
GECCO
2009
Springer
14 years 12 days ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
MM
2000
ACM
14 years 5 days ago
2000
ACM
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
HPDC
1999
IEEE
14 years 3 days ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...