Sciweavers

1185 search results - page 79 / 237
» The Equivalence of Sampling and Searching
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
JMLR
2008
144views more  JMLR 2008»
13 years 7 months ago
Search for Additive Nonlinear Time Series Causal Models
Pointwise consistent, feasible procedures for estimating contemporaneous linear causal structure from time series data have been developed using multiple conditional independence ...
Tianjiao Chu, Clark Glymour
ACL
2012
11 years 10 months ago
Decoding Running Key Ciphers
There has been recent interest in the problem of decoding letter substitution ciphers using techniques inspired by natural language processing. We consider a different type of cla...
Sravana Reddy, Kevin Knight
CVPR
2006
IEEE
14 years 10 months ago
Accurate Face Alignment using Shape Constrained Markov Network
In this paper, we present a shape constrained Markov network for accurate face alignment. The global face shape is defined as a set of weighted shape samples which are integrated ...
Lin Liang, Fang Wen, Ying-Qing Xu, Xiaoou Tang, He...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks