Sciweavers

2080 search results - page 214 / 416
» Measuring empirical computational complexity
Sort
View
126
Voted
SIGIR
2010
ACM
15 years 5 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
134
Voted
IM
2006
15 years 5 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
129
Voted
IWC
2007
104views more  IWC 2007»
15 years 5 months ago
Lightweight techniques for structural evaluation of animated metaphors
Visual metaphors in the form of still or animated pictures have been used in user interfaces with the hope of enhancing learning and use of computer applications. This paper studi...
Jorma Sajaniemi, Tuija Stützle
JAISE
2010
163views Algorithms» more  JAISE 2010»
14 years 12 months ago
Affective negotiation support systems
Negotiation is a process in which two or more parties aim to reach a joint agreement. As such negotiation involves rational decision making about options and issues. However, negot...
Joost Broekens, Catholijn M. Jonker, John-Jules Ch...
PODS
2008
ACM
211views Database» more  PODS 2008»
16 years 5 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy