MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Dimension and Algorithms." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

490 documents found, showing 1 through 10. Next 10 →

ATOM

Any-Dimension Algorithms
by David Musliner, Edmund H. Durfee, Kang G. Shin — 1992 — In Proc. Workshop on Real-Time Operating Systems and Software
…Any-Dimension Algorithms David J. Musliner Edmund H. Durfee Kang G. Shin Computer Science…
Cited by 6 (1 self) – Add To MetaCart

Effective strong dimension in algorithmic information and computational complexity
by Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo — 2004 — SIAM Journal on Computing
…Effective Strong Dimension in Algorithmic Information and Computational Complexity Krishna B…
Cited by 61 (24 self) – Add To MetaCart

On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
by S. Muthukrishnan, Muthukrishnan Viswanath Poosala, Torsten Suel — 1999 — In Proceedings of the 7th International Conference on Database Theory
…On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications S…
Cited by 31 (7 self) – Add To MetaCart

Effective Fractal Dimension in Algorithmic Information Theory
by Elvira Mayordomo — 2006
…Effective Fractal Dimension in Algorithmic Information Theory 1 Introduction Elvira Mayordomo…
Cited by 1 (1 self) – Add To MetaCart

Is nonlinearity relevant for detecting changes in EEG?
by Milan Palus, Vladimir Komarek, Zbynek Hrncir, Tomas Prochazka, Clinic Of Paediatric Neurology, Dr. Milan Palus — 1999
… of this measure, as well as its results with results of a correlation dimension algorithm. 2 Entropy rates…
Add To MetaCart

Algorithms for Proximity Problems in Higher Dimensions
by Matthew Dickerson, David Eppstein — 1996 — Comput. Geom. Theory Appl
…Algorithms for Proximity Problems in Higher Dimensions Matthew T. Dickerson Department…
Cited by 17 (2 self) – Add To MetaCart

Towards Optimal epsilon-Approximate Nearest Neighbor Algorithms in Constant Dimensions
by Matthew Cary — 2001 — J. Algorithms
…Towards Optimal #-Approximate Nearest Neighbor Algorithms in Constant Dimensions Matthew Cary…
Add To MetaCart

A Comparative Application of Convex Hull Algorithms in Two and Three Dimensions
by Kyriakos Zervoudakis Dept, Kyriakos Zervoudakis, Ioannis Z. Emiris
…A comparative application of convex hull algorithms in two and three dimensions Kyriakos…
Add To MetaCart

Network Dimensioning Based On Refined Blocking Measures
by Sándor Molnár, Telematics — 1994
… In this paper extensions of the network dimensioning algorithms are presented for handling cases where…
Cited by 1 (1 self) – Add To MetaCart

Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
by Fabian J. Theis, O Georgiev, Andrzej Cichocki — 2004 — In Proceedings of 12th European Symposium on Artificial Neural Networks (ESANN2004
…, the computational time of the presented algorithm is linear in the sample number and independent of source dimension…
Cited by 10 (7 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB