12193 search results - page 65 / 2439 » It's not all about |
102
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
IJCV
1998
14 years 11 months ago
1998
Two images of a single scene/object are related by the epipolar geometry, which can be described by a 3x3 singular matrix called the essential matrix if images’ internal paramete...
107
click to vote
TIT
2008
14 years 11 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
APLAS
2003
ACM
15 years 5 months ago
2003
ACM
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...