TITLE

Discussion of "Website Morphing."

AUTHOR(S)
Varian, Hal
PUB. DATE
March 2009
SOURCE
Marketing Science;Mar/Apr2009, Vol. 28 Issue 2, p224
SOURCE TYPE
Academic Journal
DOC. TYPE
Opinion
ABSTRACT
The author's views are presented concerning "Website Morphing," an article by John R. Hauser, Glen L. Urban, Guilherme Liberali, and Michael Braun which is in this issue of "Marketing Science." The research method used in the Hauser and colleagues' paper concerning website design and the personalization of a user interface are mentioned.
ACCESSION #
40400772

 

Related Articles

  • Discussion on "Website Morphing" by Hauser, Urban, Liberali, and Braun. Gittins, John // Marketing Science;Mar/Apr2009, Vol. 28 Issue 2, p225 

    The author's views are presented concerning "Website Morphing," an article by John R. Hauser, Glen L. Urban, Guilherme Liberali, and Michael Braun which is in this issue of "Marketing Science." The author praises Hauser and his colleagues for incorporating the Gittins indices theory into their...

  • Morphing Banner Advertising. Urban, Glen L.; Liberali, Guilherme (Gui); MacDonald, Erin; Bordley, Robert; Hauser, John R. // Marketing Science;Jan/Feb2014, Vol. 33 Issue 1, p27 

    Researchers and practitioners devote substantial effort to targeting banner advertisements to consumers, but they focus less effort on how to communicate with consumers once targeted. Morphing enables a website to learn, automatically and near optimally, which banner advertisements to serve to...

  • Response to Comments on "Website Morphing.". Hauser, John R.; Urban, Glen L.; Liberali, Guilherme; Braun, Michael // Marketing Science;Mar/Apr2009, Vol. 28 Issue 2, p227 

    Website morphing draws on the Expected Gittins' solution to a partially observable Markov process, on the rapid consumer-segment updating with Bayesian methods, and on matching a website's look and feel to a visitor's cognitive style. In each area there are exciting research opportunities...

  • Morphing more fun than photos.  // Current Science;12/1/95, Vol. 81 Issue 7, p13 

    Focuses on the computer animation technique called morphing. Digitization of facial features; Seeing what a future child would look like.

  • Morphed images of basic emotional expressions: Ratings on Russell's bipolar field. Takehara, Takuma; Suzuki, Naoto // Perceptual & Motor Skills;Dec97 Part 1, Vol. 85 Issue 3, p1003 

    Focuses on a study in relation to morphing and synthesizing of facial images through this technique. Reference to the synthesizing of facial images using the Wire Frame Model in Japan; Methods used in the study; Results of the methods used in the study; Indepth look at the study.

  • Familiarity Hijack: How Morphing Faces with Celebrity Images Can Enhance Trust. Tanner, Rob; Ah-reum Maeng // Advances in Consumer Research;2010, Vol. 37, p914 

    An abstract of the article "Familiarity Hijack: How Morphing Faces with Celebrity Images Can Enhance Trust," by Rob Tanner and Ah-reum Maengis presented.

  • Letters. Leopizzi, Anthony J. // Westchester County Business Journal;12/21/2009, Vol. 48 Issue 51, p4 

    A letter to the editor is presented in response to the article "The morphing of the American character," by Maureen Morgan in the November 23, 2009 issue.

  • Do Learning Styles Matter?  // Wilson Quarterly;Spring2010, Vol. 34 Issue 2, p74 

    The article discusses research about the concept of learning style. It notes that the ideal study would sort students by style and assign them randomly to one of several styles of instruction, and measure results. It notes that few such studies exist but those that do contradict the learning...

  • An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing. Evgeny Lipovetsky; Nira Dyn // Advances in Computational Mathematics;Jan2007, Vol. 26 Issue 1-3, p269 

    Abstract??Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed ?metric average?, we developed an algorithm for the computation of the metric average between two intersecting convex polygons in 2D....

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics