Sciweavers

730 search results - page 19 / 146
» Faster dimension reduction
Sort
View
SAC
2005
ACM
14 years 2 months ago
Estimating manifold dimension by inversion error
Video and image datasets can often be described by a small number of parameters, even though each image usually consists of hundreds or thousands of pixels. This observation is of...
Shawn Martin, Alex Bäcker
GLOBECOM
2009
IEEE
14 years 15 days ago
Near-ML Detection over a Reduced Dimension Hypersphere
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
14 years 11 days ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
ICCAD
1996
IEEE
121views Hardware» more  ICCAD 1996»
14 years 24 days ago
Identification of unsettable flip-flops for partial scan and faster ATPG
State justification is a time-consuming operation in test generation for sequential circuits. In this paper, we present a technique to rapidly identify state elements (flip-flops)...
Ismed Hartanto, Vamsi Boppana, W. Kent Fuchs
ECCC
2006
112views more  ECCC 2006»
13 years 8 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas