Sciweavers

5451 search results - page 251 / 1091
» On very high degrees
Sort
View
JCP
2008
171views more  JCP 2008»
15 years 7 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
CPC
2007
125views more  CPC 2007»
15 years 7 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
MCSS
2006
Springer
15 years 7 months ago
A performance comparison of robust adaptive controllers: linear systems
We consider robust adaptive control designs for relative degree one, minimum phase linear systems of known high frequency gain. The designs are based on the dead-zone and projecti...
Ahmad Sanei, Mark French
SCN
2008
Springer
166views Communications» more  SCN 2008»
15 years 7 months ago
Secure, pseudonymous, and auditable communication in vehicular ad hoc networks
Abstract-- Vehicular ad hoc networks (VANETs) represent a promising new communication technology that can facilitate many new forms of automotive applications. Many of the applicat...
Pandurang Kamat, Arati Baliga, Wade Trappe
SOCO
2008
Springer
15 years 7 months ago
Controlling the Performance Overhead of Component-Based Systems
Flexibility can significantly impact performance. Some component-based frameworks come with a near to zero overhead but provide only build-time configurability. Other solutions pro...
Olivier Lobry, Juraj Polakovic