Sciweavers

1813 search results - page 256 / 363
» Calculi of Approximation Spaces
Sort
View
KDD
2007
ACM
160views Data Mining» more  KDD 2007»
16 years 4 months ago
Show me the money!: deriving the pricing power of product features by mining consumer reviews
The increasing pervasiveness of the Internet has dramatically changed the way that consumers shop for goods. Consumergenerated product reviews have become a valuable source of inf...
Nikolay Archak, Anindya Ghose, Panagiotis G. Ipeir...
ICALP
2009
Springer
16 years 4 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 4 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
ALT
2006
Springer
16 years 1 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
INFOCOM
2008
IEEE
15 years 10 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel