Sciweavers

Share
EDBT
2011
ACM
231views Database» more  EDBT 2011»
8 years 7 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
COMPGEOM
2011
ACM
8 years 7 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...

0
posts
with
0
views
98profile views
xiaolonghuangStudent, PhD
xiaolonghuang
SIAMDM
2010
75views more  SIAMDM 2010»
8 years 10 months ago
An Efficient Sparse Regularity Concept
Let A be a 0/1 matrix of size m
Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
MLDM
2010
Springer
8 years 10 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
WWW
2011
ACM
8 years 10 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
CORR
2011
Springer
167views Education» more  CORR 2011»
8 years 10 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
FSTTCS
2010
Springer
9 years 1 months ago
Finding Sparser Directed Spanners
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
Piotr Berman, Sofya Raskhodnikova, Ge Ruan
TMC
2010
196views more  TMC 2010»
9 years 2 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
MP
2010
172views more  MP 2010»
9 years 2 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
books