Sciweavers

6365 search results - page 397 / 1273
» Fast Local Computation Algorithms
Sort
View
MICCAI
2009
Springer
16 years 8 months ago
Think Global, Act Local; Projectome Estimation with BlueMatter
Estimating the complete set of white matter fascicles (the projectome) from diffusion data requires evaluating an enormous number of potential pathways; consequently, most algorith...
Anthony Sherbondy, Robert Dougherty, Rajagopal A...
SP
1997
IEEE
126views Security Privacy» more  SP 1997»
15 years 11 months ago
Filtering Postures: Local Enforcement for Global Policies
When packet filtering is used as a security mechanism, different routers may need to cooperate to enforce the desired security policy. It is difficult to ensure that they will d...
Joshua D. Guttman
ICSE
2003
IEEE-ACM
16 years 7 months ago
Precise Dynamic Slicing Algorithms
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
DATE
2007
IEEE
117views Hardware» more  DATE 2007»
16 years 1 months ago
Rapid and accurate latch characterization via direct Newton solution of setup/hold times
Characterizing setup/hold times of latches and registers, a crucial component for achieving timing closure of large digital designs, typically occupies months of computation in in...
Shweta Srivastava, Jaijeet S. Roychowdhury
ICGA
1997
133views Optimization» more  ICGA 1997»
15 years 8 months ago
Messy Genetic Algorithms for Subset Feature Selection
Subset Feature Selection problems can have severalattributes which may make Messy Genetic Algorithms an appropriateoptimization method. First, competitive solutions may often use ...
L. Darrell Whitley, J. Ross Beveridge, Cesar Guerr...