Sciweavers

1887 search results - page 38 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Discrete Curvature Calculation For Fast Level Set Segmentation
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...
CVPR
2009
IEEE
15 years 2 months ago
Discriminative Subvolume Search for Efficient Action Detection
Actions are spatio-temporal patterns which can be characterized by collections of spatio-temporal invariant features. Detection of actions is to find the re-occurrences (e.g. th...
Junsong Yuan (Northwestern University), Zicheng Li...
ALT
2003
Springer
13 years 11 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
VVS
1998
IEEE
106views Visualization» more  VVS 1998»
13 years 12 months ago
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
Cláudio T. Silva, Joseph S. B. Mitchell, Pe...
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 11 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson