5030 search results - page 669 / 1006 » cases 2007 |
173
click to vote
STACS
2007
Springer
16 years 29 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
216
click to vote
VLDB
2007
ACM
16 years 29 days ago
2007
ACM
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
220
click to vote
WADS
2007
Springer
16 years 29 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
191
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
171
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
In this Paper, we describe the various low power techniques for mobile application SoCs based on the integrated platform "UniPhier". To minimize SoC power dissipation, h...