Sciweavers

2629 search results - page 526 / 526
» complex 2009
Sort
View
FSTTCS
2009
Springer
13 years 11 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
13 years 11 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
13 years 9 months ago
Autonomous motorcycles for agile maneuvers, part I: Dynamic modeling
— Single-track vehicles, such as motorcycles, provide an agile mobile platform. Modeling and control of motorcycles for agile maneuvers, such as those by professional racing ride...
Jingang Yi, Yizhai Zhang, Dezhen Song
ANCS
2009
ACM
13 years 2 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao