2069 search results - page 133 / 414 » Linear time algorithms for Clobber |
250
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
148
click to vote
NETWORK
2011
14 years 11 months ago
2011
Inferring the subjective perception of a video stream in real time continues to be a stiff problem. This article presents MintMOS: a lightweight, no-reference, loadable kernel mod...
134
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
144
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
137
click to vote
DAC
2009
ACM
15 years 11 months ago
2009
ACM
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...