2432 search results - page 259 / 487 » Degrees and choice numbers |
191
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
242
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
186
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
250
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
245
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...