Sciweavers

1208 search results - page 88 / 242
» On Counting Generalized Colorings
Sort
View
ESA
2007
Springer
133views Algorithms» more  ESA 2007»
14 years 3 months ago
Order Statistics in the Farey Sequences in Sublinear Time
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
Jakub Pawlewicz
COMPGEOM
2004
ACM
14 years 2 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
E4MAS
2006
Springer
14 years 26 days ago
A Unified Model for Physical and Social Environments
Abstract. The AGRE model proposed by Ferber et al. is based on an interesting generalization of both physical and social environments. In this paper we revisit the AGRE model and e...
José-Antonio Báez-Barranco, Tiberiu ...
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 15 days ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
AMW
2009
13 years 10 months ago
Data Expiration and Aggregate Queries
We investigate the space requirements for summaries needed for maintaining exact answers to aggregate queries over histories of relational databases. We show that, in general, a su...
David Toman