Sciweavers

NIPS
2008
13 years 6 months ago
Nonrigid Structure from Motion in Trajectory Space
Existing approaches to nonrigid structure from motion assume that the instantaneous 3D shape of a deforming object is a linear combination of basis shapes, which have to be estima...
Ijaz Akhter, Yaser Sheikh, Sohaib Khan, Takeo Kana...
AAAI
2008
13 years 6 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
13 years 8 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
COLT
2005
Springer
13 years 10 months ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
CVPR
2005
IEEE
13 years 10 months ago
Linear Combination Representation for Outlier Detection in Motion Tracking
In this paper we show that Ullman and Basri’s linear combination (LC) representation, which was originally proposed for alignment-based object recognition, can be used for outli...
Guodong Guo, Charles R. Dyer, Zhengyou Zhang
CIKM
2007
Springer
13 years 10 months ago
Combining resources with confidence measures for cross language information retrieval
Query translation in Cross Language Information Retrieval (CLIR) can be performed using multiple resources. Previous attempts to combine different translation resources use simple...
Youssef Kadri, Jian-Yun Nie
ICCV
2007
IEEE
13 years 11 months ago
Support Kernel Machines for Object Recognition
Kernel classifiers based on Support Vector Machines (SVM) have recently achieved state-of-the art results on several popular datasets like Caltech or Pascal. This was possible by...
Ankita Kumar, Cristian Sminchisescu
INFOCOM
2009
IEEE
13 years 11 months ago
Network Coding Meets TCP
—We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the sourc...
Jay Kumar Sundararajan, Devavrat Shah, Muriel M&ea...
DCC
2009
IEEE
14 years 5 months ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
ICPR
2008
IEEE
14 years 5 months ago
Combining content and structure similarity for XML document classification using composite SVM kernels
Combination of structure and content features is necessary for effective retrieval and classification of XML documents. Composite kernels provide a way for fusion of content and s...
Pabitra Mitra, Saptarshi Ghosh