Sciweavers

2434 search results - page 97 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
NIPS
2007
15 years 4 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
15 years 8 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
278
Voted
CVPR
2005
IEEE
2143views Computer Vision» more  CVPR 2005»
16 years 12 months ago
Level Set Evolution Without Re-initialization: A New Variational Formulation
"In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and theref...
Chunming Li, Chenyang Xu, Changfeng Gui, and Marti...
VIIP
2001
15 years 4 months ago
3-D Haar Wavelet Transformation and Texture-based 3-D Reconstruction of Biomedical Data Sets
Enhanced biomedical image scanning technology and growing network accessibility have created a need for faster and more efficient data exchange over the Internet and in closed net...
Pujita Pinnamaneni, Sagar Saladi, Joerg Meyer
INFOCOM
2010
IEEE
15 years 1 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen