نتایج جستجو برای: traversing lines

تعداد نتایج: 220803  

Journal: :SIAM J. Comput. 1999
Paul Beame Allan Borodin Prabhakar Raghavan Walter L. Ruzzo Martin Tompa

We prove a time-space tradeoff for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Rackoff’s “jumping automata for graphs.”

Journal: :Ars aeterna 2023

Abstract Violence in William Shakespeare’s Hamlet follows stage-managed theatrics at the level of language and images used, construction a theatre that comments on theatre, staged minds. The images, sound, stage mind are necessary steps for to create meta-self. Metatheatre grotesque deeply connected violence; their association makes what research calls article combines different theoretical con...

UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...

1996
William J. Dally Leonard McMillan Gary Bishop Henry Fuchs

This paper introduces the delta tree, a data structure that represents an object using a set of reference images. It also describes an algorithm for generating arbitrary re-projections of an object by traversing its delta tree. Delta trees are an efficient representation in terms of both storage and rendering performance. Each node of a delta tree stores an image taken from a point on a samplin...

2006
Che-Bin Liu Ruei-Sung Lin Narendra Ahuja Ming-Hsuan Yang

We formulate the problem of dynamic texture synthesis as a nonlinear manifold learning and traversing problem. We characterize dynamic textures as the temporal changes in spectral parameters of image sequences. For continuous changes of such parameters, it is commonly assumed that all these parameters lie on or close to a low-dimensional manifold embedded in the original configuration space. Fo...

Journal: :MONET 2003
Thomas Clouqueur Veradej Phipatanasuphorn Parameswaran Ramanathan Kewal K. Saluja

Sensing devices can be deployed to form a network for monitoring a region of interest. This paper investigates detection of a target traversing the region being monitored by using collaborative target detection algorithms among the sensors. The objective of the study is to develop a low cost sensor deployment strategy to meet a performance criteria. The paper defines a path exposure metric as a...

Journal: :CoRR 2014
David M. S. Rodrigues Vitorino Ramos

The past decade has seen the rapid development of the online newsroom. News published online are the main outlet of news surpassing traditional printed newspapers. This poses challenges to the production and to the consumption of those news. With those many sources of information available it is important to find ways to cluster and organise the documents if one wants to understand this new sys...

2014
Laura C. Kelley Lauren L. Lohmer Elliott J. Hagedorn David R. Sherwood

The basement membrane is a dense, highly cross-linked, sheet-like extracellular matrix that underlies all epithelia and endothelia in multicellular animals. During development, leukocyte trafficking, and metastatic disease, cells cross the basement membrane to disperse and enter new tissues. Based largely on in vitro studies, cells have been thought to use proteases to dissolve and traverse thi...

Journal: :Journal of biomedical informatics 2006
Michael A. Charleston Susan L. Perkins

Cophylogenetic analysis supposes that two or more phylogenetic trees for linked groups have been constructed, and explores the relationships the trees have with each other. These types of analyses are most commonly used to assess relationships between hosts and their parasites, however the methodology can also be applied to diverse types of problems such as an examination of the phylogenies of ...

2008
S. Beddiaf

This paper revisits the ideas of seeking unconstrained minima by following a continuous steepest descent path (CSDP). We are especially interested in the merits of such an approach in regions where the objective function is non-convex and Newton-like methods become ineffective. The paper combines ODE-trajectory following with trust-region ideas to give an algorithm which performs curvilinear se...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید