Sciweavers

222 search results - page 4 / 45
» Locally Compact Path Spaces
Sort
View
WIDM
2004
ACM
15 years 2 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
ADCM
2010
90views more  ADCM 2010»
14 years 9 months ago
Local reconstruction for sampling in shift-invariant spaces
The local reconstruction from samples is one of most desirable properties for many applications in signal processing, but it has not been given as much attention. In this paper, we...
Qiyu Sun
EMMCVPR
2001
Springer
15 years 2 months ago
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
Bernd Fischer, Thomas Zöller, Joachim M. Buhm...
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 1 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
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
13 years 9 months ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek