Sciweavers

2295 search results - page 459 / 459
» Learning Overcomplete Representations
Sort
View
CICLING
2011
Springer
12 years 9 months ago
Temporal Analysis of Sentiment Events - A Visual Realization and Tracking
In recent years, extraction of temporal relations for events that express sentiments has drawn great attention of the Natural Language Processing (NLP) research communities. In thi...
Dipankar Das, Anup Kumar Kolya, Asif Ekbal, Sivaji...
COMPGEOM
2011
ACM
12 years 9 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
JCDL
2011
ACM
221views Education» more  JCDL 2011»
12 years 8 months ago
Integrating implicit structure visualization with authoring promotes ideation
We need to harness the growing wealth of information in digital libraries to support intellectual work involving creative and exploratory processes. Prior research on hypertext au...
Andrew M. Webb, Andruid Kerne
WWW
2003
ACM
14 years 6 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 7 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...