4372 search results - page 220 / 875 » Algorithmic Theories of Everything |
120
Voted
COMPGEOM
2007
ACM
15 years 5 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
104
click to vote
JCIT
2007
15 years 27 days ago
2007
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
112
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
In this paper we introduce a new type of pattern – a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at diffe...
107
Voted
MOBIHOC
2007
ACM
16 years 17 days ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
105
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...