Sciweavers

1814 search results - page 48 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 2 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
11 years 11 months ago
Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
Junfeng Zhou, Zhifeng Bao, Wei Wang, Tok Wang Ling...
COMPGEOM
2005
ACM
13 years 11 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
NIPS
2008
13 years 10 months ago
ICA based on a Smooth Estimation of the Differential Entropy
In this paper we introduce the MeanNN approach for estimation of main information theoretic measures such as differential entropy, mutual information and divergence. As opposed to...
Lev Faivishevsky, Jacob Goldberger
COLING
2010
13 years 4 months ago
Extracting and Ranking Product Features in Opinion Documents
An important task of opinion mining is to extract people's opinions on features of an entity. For example, the sentence, "I love the GPS function of Motorola Droid"...
Lei Zhang, Bing Liu, Suk Hwan Lim, Eamonn O'Brien-...