Sciweavers

10493 search results - page 23 / 2099
» Dynamic Word Problems
Sort
View
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
13 years 11 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
ICRA
2006
IEEE
118views Robotics» more  ICRA 2006»
14 years 1 months ago
Symbolic Control for Underactuated Differentially Flat Systems
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
Adriano Fagiolini, Luca Greco, Antonio Bicchi, Ben...
ADMA
2006
Springer
112views Data Mining» more  ADMA 2006»
14 years 1 months ago
Finding Time Series Discords Based on Haar Transform
The problem of finding anomaly has received much attention recently. However, most of the anomaly detection algorithms depend on an explicit definition of anomaly, which may be i...
Ada Wai-Chee Fu, Oscar Tat-Wing Leung, Eamonn J. K...
HPCA
1999
IEEE
14 years 1 days ago
Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
David Brooks, Margaret Martonosi
SIGIR
2003
ACM
14 years 29 days ago
Domain-independent text segmentation using anisotropic diffusion and dynamic programming
This paper presents a novel domain-independent text segmentation method, which identifies the boundaries of topic changes in long text documents and/or text streams. The method c...
Xiang Ji, Hongyuan Zha