Sciweavers

2312 search results - page 25 / 463
» The complexity of estimating min-entropy
Sort
View
MICCAI
2010
Springer
13 years 8 months ago
Construction of Neuroanatomical Shape Complex Atlas from 3D Brain MRI
Abstract. This paper proposes a novel technique for constructing a neuroanatomical shape complex atlas using an information geometry framework. A shape complex is a collection of s...
Ting Chen, Anand Rangarajan, Stephan J. Eisenschen...
PVLDB
2008
116views more  PVLDB 2008»
13 years 9 months ago
Accuracy estimate and optimization techniques for SimRank computation
The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of th...
Dmitry Lizorkin, Pavel Velikhov, Maxim N. Grinev, ...
SAC
2012
ACM
12 years 5 months ago
Local bandwidth selectors for deconvolution kernel density estimation
We consider kernel density estimation when the observations are contaminated by measurement errors. It is well known that the success of kernel estimators depends heavily on the c...
Achilleas Achilleos, Aurore Delaigle
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 8 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 8 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...