Results 1 - 10
of
3,900
On-Line Construction of Suffix Trees
, 1995
"... An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract
-
Cited by 437 (2 self)
- Add to MetaCart
An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part
Region Filling and Object Removal by Exemplar-Based Image Inpainting
, 2004
"... A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this problem has been addressed by two classes of algorithms: 1) “texture synthesis” algorithms for generating large image re ..."
Abstract
-
Cited by 365 (1 self)
- Add to MetaCart
regions from sample textures and 2) “inpainting ” techniques for filling in small image gaps. The former has been demonstrated for “textures”—repeating twodimensional patterns with some stochasticity; the latter focus on linear “structures ” which can be thought of as one-dimensional patterns
MAPS: Multiresolution Adaptive Parameterization of Surfaces
, 1998
"... We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2-manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial param ..."
Abstract
-
Cited by 265 (12 self)
- Add to MetaCart
parameterization is further improved through a hierarchical smoothing procedure based on Loop subdivision applied in the parameter domain. Our method supports both fully automatic and user constrained operations. In the latter, we accommodate point and edge constraints to force the align- # wailee
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
- AUTONOMOUS ROBOTS, SPECIAL ISSUE ON INTELLIGENT EMBEDDED SYSTEMS
, 2001
"... This paper describes an incremental deployment algorithm for mobile sensor networks. A mobile sensor network is a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. The algorithm deploys nodes one-at-atime into an unknown environment, ..."
Abstract
-
Cited by 228 (9 self)
- Add to MetaCart
, with each node making use of information gathered by previously deployed nodes to determine its target location. The algorithm is designed to maximize network `coverage' whilst simultaneously ensuring that nodes retain line-of-sight with one another (this latter constraint arises from the need
Object removal by exemplar-based inpainting
, 2003
"... A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this problem has been addressed by two classes of algorithms: (i) “texture synthesis ” algorithms for generating large image ..."
Abstract
-
Cited by 188 (3 self)
- Add to MetaCart
regions from sample textures, and (ii) “inpainting ” techniques for filling in small image gaps. The former work well for “textures ” – repeating twodimensional patterns with some stochasticity; the latter focus on linear “structures ” which can be thought of as onedimensional patterns, such as lines
Self-determination and persistence in a real-life setting: Toward a motivational model of high school dropout.
- Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract
-
Cited by 183 (19 self)
- Add to MetaCart
(see Much research supports this line of reasoning. For instance, controlling behavior from the teacher It is important to emphasize that the motivational model posits that social agents do not influence students' motivation directly. Rather, in line with self-determination theory, social agents
On the security of joint signature and encryption
, 2002
"... We formally study the notion of a joint signature and encryption in the public-key setting. We refer to this primitive as signcryption, adapting the terminology of [35]. We present two definitions for the security of signcryption depending on whether the adversary is an outsider or a legal user of t ..."
Abstract
-
Cited by 150 (6 self)
- Add to MetaCart
imply a gain in efficiency over the StE and EtS schemes. We also show that the new CtE&S method elegantly combines with the recent “hash-sign-switch” technique of [30], leading to efficient on-line/off-line signcryption. Finally and of independent interest, we discuss the definitional inadequacy
Dynamic Montague Grammar
- Papers from the Second Symposium on Logic and Language
, 1989
"... this paper is based was presented on several occasions, the first of which was the Stuttgart conference on discourse representation theory, held in November 1987. Various people have given us the benefit of their comments and criticisms, for which we thank them all. Special thanks go to Paul Dekker ..."
Abstract
-
Cited by 143 (2 self)
- Add to MetaCart
, confronting other frameworks with MG, trying to unify them, is also putting things to the test. Can this analysis be cast in a compositional mould? But also, what consequences does compositionality have in this case? (And, to be sure, some of the latter may cause us to reject it after all.) So, we feel
Loop-corrected compactifications of the heterotic string with line bundles
, 2005
"... We consider the E8×E8 heterotic string theory compactified on Calabi-Yau manifolds with bundles containing abelian factors in their structure group. Generic low energy consequences such as the generalised Green-Schwarz mechanism for the multiple anomalous abelian gauge groups are studied. We also co ..."
Abstract
-
Cited by 84 (16 self)
- Add to MetaCart
compute the holomorphic gauge couplings and induced Fayet-Iliopoulos terms up to one-loop order, where the latter are interpreted as stringy one-loop corrections to the Donaldson-Uhlenbeck-Yau condition. Such models generically have frozen combinations of Kähler and dilaton moduli. We study concrete
Image Based Flow Visualization
, 2002
"... A new method for the visualization of two-dimensional fluid flow is presented. The method is based on the advection and decay of dye. These processes are simulated by defining each frame of a flow animation as a blend between a warped version of the previous image and a number of background images. ..."
Abstract
-
Cited by 133 (3 self)
- Add to MetaCart
. For the latter a sequence of filtered white noise images is used: filtered in time and space to remove high frequency components. Because all steps are done using images, the method is named Image Based Flow Visualization (IBFV). With IBFV a wide variety of visualization techniques can be emulated. Flow can
Results 1 - 10
of
3,900