Sciweavers

5115 search results - page 247 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SIGIR
2011
ACM
14 years 10 months ago
Learning online discussion structures by conditional random fields
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
Hongning Wang, Chi Wang, ChengXiang Zhai, Jiawei H...
ICDCS
2011
IEEE
14 years 6 months ago
SpotME If You Can: Randomized Responses for Location Obfuscation on Mobile Phones
Abstract—Nowadays companies increasingly aggregate location data from different sources on the Internet to offer locationbased services such as estimating current road traffic c...
Daniele Quercia, Ilias Leontiadis, Liam McNamara, ...
ISAAC
1999
Springer
70views Algorithms» more  ISAAC 1999»
15 years 11 months ago
Multiple Spin-Block Decisions
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
Peter Damaschke
FOCS
2008
IEEE
16 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
196
Voted
TNN
2011
107views more  TNN 2011»
15 years 2 months ago
Iterative Gaussianization: From ICA to Random Rotations
Abstract—Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this paper, we propose a solution to t...
Valero Laparra, Gustavo Camps-Valls, Jesus Malo