Sciweavers

4865 search results - page 595 / 973
» The Complexity of Graph Connectivity
Sort
View
150
Voted
VISUALIZATION
1997
IEEE
15 years 11 months ago
Architectural walkthroughs using portal textures
This paper outlines a method to dynamically replace portals with textures in a cell-partitioned model. The rendering complexity is reduced to the geometry of the current cell thus...
Daniel G. Aliaga, Anselmo Lastra
HPDC
1995
IEEE
15 years 10 months ago
A Versatile Packet Multiplexer for Quality-of-Service Networks
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...
Jörg Liebeherr, Dallas E. Wrege
CSL
2008
Springer
15 years 8 months ago
Extensional Uniformity for Boolean Circuits
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
Pierre McKenzie, Michael Thomas, Heribert Vollmer
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 8 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
RAS
2006
199views more  RAS 2006»
15 years 6 months ago
Cooperative hole avoidance in a swarm-bot
In this paper, we study coordinated motion in a swarm robotic system, called a swarm-bot. A swarm-bot is a self-assembling and self-organising artifact, composed of a swarm of s-b...
Vito Trianni, Stefano Nolfi, Marco Dorigo