Sciweavers

2080 search results - page 212 / 416
» Measuring empirical computational complexity
Sort
View
WWW
2005
ACM
16 years 5 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
MSWIM
2009
ACM
15 years 12 months ago
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
Shabbir Ahmed, Salil S. Kanhere
PERSUASIVE
2009
Springer
15 years 11 months ago
Persuading users through counseling dialogue with a conversational agent
We present an empirical study of the effect of a computer agent designed to engage a user in a persuasive counseling dialogue on attitudes towards regular exercise. We used two ma...
Daniel Schulman, Timothy W. Bickmore
143
Voted
MMSEC
2006
ACM
148views Multimedia» more  MMSEC 2006»
15 years 11 months ago
Minimizing the embedding impact in steganography
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
Jessica J. Fridrich
143
Voted
EWCBR
2004
Springer
15 years 10 months ago
Case Retrieval Using Nonlinear Feature-Space Transformation
Abstract. Good similarity functions are at the heart of effective case-based reasoning. However, the similarity functions that have been designed so far have been mostly linear, we...
Rong Pan, Qiang Yang, Lei Li