876 search results - page 13 / 176 » Complexity in geometric SINR |
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
COMPGEOM
2004
ACM
14 years 27 days ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
BMCBI
2010
13 years 2 months ago
2010
Background: We suggest a new type of modeling approach for the coarse grained, particle-based spatial simulation of combinatorially complex chemical reaction systems. In our appro...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
JAT
2010
13 years 5 months ago
2010
Abstract. The notion of complex B-spline is extended to a multivariate setting by means of ridge functions employing the known geometric relationship between ordinary B-splines and...