10890 search results - page 384 / 2178 » Automatic Complexity Analysis |
216
click to vote
MOBICOM
2006
ACM
16 years 22 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
194
click to vote
PODC
2006
ACM
16 years 22 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
186
click to vote
SMA
2005
ACM
16 years 10 days ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
196
click to vote
DOCENG
2003
ACM
16 years 1 days ago
2003
ACM
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
189
Voted
AI
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...