Sciweavers

3702 search results - page 419 / 741
» All Pairings Are in a Group
Sort
View
SIAMCOMP
2012
13 years 9 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
15 years 11 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
Vladimir Braverman and Rafail Ostrovsky
SAGA
2007
Springer
16 years 28 days ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
BMCBI
2007
107views more  BMCBI 2007»
15 years 7 months ago
antiCODE: a natural sense-antisense transcripts database
Background: Natural antisense transcripts (NATs) are endogenous RNA molecules that exhibit partial or complete complementarity to other RNAs, and that may contribute to the regula...
Yifei Yin, Yi Zhao, Jie Wang, Changning Liu, Shugu...
CVPR
2003
IEEE
16 years 8 months ago
Learning Affinity Functions for Image Segmentation: Combining Patch-based and Gradient-based Approaches
This paper studies the problem of combining region and boundary cues for natural image segmentation. We employ a large database of manually segmented images in order to learn an o...
Charless Fowlkes, David R. Martin, Jitendra Malik