Sciweavers

3991 search results - page 158 / 799
» Bounding homogeneous models
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 8 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
AAECC
2003
Springer
119views Algorithms» more  AAECC 2003»
14 years 1 months ago
Optimal 2-Dimensional 3-Dispersion Lattices
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...
Moshe Schwartz, Tuvi Etzion
CVPR
1999
IEEE
14 years 10 months ago
Fundamental Bounds on Edge Detection: An Information Theoretic Evaluation of Different Edge Cues
We treat the problem of edge detection as one of statistical inference. Local edge cues, implemented by filters, provide information about the likely positions of edges which can ...
Scott Konishi, Alan L. Yuille, James M. Coughlan, ...
VLDB
2008
ACM
140views Database» more  VLDB 2008»
14 years 8 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao
ICASSP
2008
IEEE
14 years 2 months ago
Information theoretic bounds on neural prosthesis effectiveness: The importance of spike sorting
We compute the capacity of neural prostheses using a vector Poisson process model for the neural population channel. For single-electrode stimulation prostheses, the capacity is p...
Ilan N. Goodman, Don H. Johnson