Results 1  10
of
1,978
Lower order circle and ellipse hough transform
 J. Pattern Recognition
, 1997
"... AbstractIn this work we present two new algorithms for the detection of circles and ellipses which use the FHT algorithm as a basis: Fast Circle Hough Transform (FCHT) and Fast Ellipse Hough Transform (FEHT). The first stage of these two algorithms, devoted to obtaining the centers of the figures, ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
AbstractIn this work we present two new algorithms for the detection of circles and ellipses which use the FHT algorithm as a basis: Fast Circle Hough Transform (FCHT) and Fast Ellipse Hough Transform (FEHT). The first stage of these two algorithms, devoted to obtaining the centers of the figures
Ecology of the family as a context for human development: Research perspectives.
 Developmental Psychology,
, 1986
"... This review collates and examines critically a theoretically convergent but widely dispersed body of research on the influence of external environments on the functioning of families as contexts of human development. Investigations falling within this expanding domain include studies of the interac ..."
Abstract

Cited by 518 (0 self)
 Add to MetaCart
scientific paradigms for investigating the impact of environment on development. These paradigms provide a useful framework for ordering and analyzing studies bearing on the topic of this review. At the most general level, the research models vary simultaneously along two dimensions. As applied
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
toyQMR and real QMR? An obvious difference is in the parameter val ues while the CPTs for toyQMR are random, the real QMR parameters are not. In particular, the prior probability of a disease node being on is extremely low in the real QMR (typically of the order of 103 ). Would low priors cause
Superstrings and topological strings at large
 N”, J. Math. Phys
"... We embed the large N ChernSimons/topological string duality in ordinary superstrings. This corresponds to a large N duality between generalized gauge systems with N = 1 supersymmetry in 4 dimensions and superstrings propagating on noncompact CalabiYau manifolds with certain fluxes turned on. We a ..."
Abstract

Cited by 254 (27 self)
 Add to MetaCart
also show that in a particular limit of the N = 1 gauge theory system, certain superpotential terms in the N = 1 system (including deformations if spacetime is noncommutative) are captured to all orders in 1/N by the amplitudes of noncritical bosonic strings propagating on a circle with self
Orders With Ten Elements Are Circle Order
, 2007
"... With a new method based on the notion of genetic algorithm and the explicit enumeration of orders, we prove that all orders on at most 10 elements are circle orders. This theorem represents the best partial result on SidneySidneyUrrutia Conjecture. ..."
Abstract
 Add to MetaCart
With a new method based on the notion of genetic algorithm and the explicit enumeration of orders, we prove that all orders on at most 10 elements are circle orders. This theorem represents the best partial result on SidneySidneyUrrutia Conjecture.
Discontinuous Order Preserving Circle Maps
"... this paper it is shown that some principal properties of circle homeomorphisms are inherited by the class of order preserving circle maps ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
this paper it is shown that some principal properties of circle homeomorphisms are inherited by the class of order preserving circle maps
Badly ordered cycles of circle maps
 Pacific J. Math
, 1998
"... A cycle of a circle map of degree one is badly ordered if it cannot be divided into blocks of consecutive points, such that the blocks are permuted by the map like points of a cycle of a rational rotation. We find the smallest possible rotation intervals that a map with a badly ordered cycle of a gi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A cycle of a circle map of degree one is badly ordered if it cannot be divided into blocks of consecutive points, such that the blocks are permuted by the map like points of a cycle of a rational rotation. We find the smallest possible rotation intervals that a map with a badly ordered cycle of a
Circle graphs and Monadic Secondorder logic
, 2005
"... A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic secondorder ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic secondorder
Joint mobility and routing for lifetime elongation in wireless sensor networks
 In Proceedijngs of IEEE INFOCOM
"... Abstract — Although many energy efficient/conserving routing protocols have been proposed for wireless sensor networks, the concentration of data traffic towards a small number of base stations remains a major threat to the network lifetime. The main reason is that the sensor nodes located near a ba ..."
Abstract

Cited by 175 (9 self)
 Add to MetaCart
by taking both base station mobility and multihop routing into account. We first study the former, and conclude that the best mobility strategy consists in following the periphery of the network (we assume that the sensors are deployed within a circle). We then consider jointly mobility and routing
P.: Squaring the circle in panoramas
 Proceedings of ICCV (2005), 1292– 1299. In
"... Pictures taken by a rotating camera cover the viewing sphere surrounding the center of rotation. Having a set of images registered and blended on the sphere what is left to be done, in order to obtain a flat panorama, is projecting the spherical image onto a picture plane. This step is unfortunately ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
Pictures taken by a rotating camera cover the viewing sphere surrounding the center of rotation. Having a set of images registered and blended on the sphere what is left to be done, in order to obtain a flat panorama, is projecting the spherical image onto a picture plane. This step
Results 1  10
of
1,978