Sciweavers

1651 search results - page 99 / 331
» Measuring the Complexity of Classification Problems
Sort
View
MMAS
2010
Springer
13 years 2 months ago
An Asymptotic Analysis of the Mean First Passage Time for Narrow Escape Problems: Part I: Two-Dimensional Domains
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
S. Pillay, Michael J. Ward, A. Peirce, Theodore Ko...
IMC
2003
ACM
14 years 1 months ago
Constructing internet coordinate system based on delay measurement
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
Hyuk Lim, Jennifer C. Hou, Chong-Ho Choi
PLDI
2009
ACM
14 years 2 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
CHI
2011
ACM
12 years 11 months ago
No clicks, no problem: using cursor movements to understand and improve search
Understanding how people interact with search engines is important in improving search quality. Web search engines typically analyze queries and clicked results, but these actions...
Jeff Huang, Ryen W. White, Susan T. Dumais
JCNS
2011
87views more  JCNS 2011»
13 years 2 months ago
Information-geometric measure of 3-neuron firing patterns characterizes scale-dependence in cortical networks
To understand the functional connectivity of neural networks, it is important to develop simple and incisive descriptors of multineuronal firing patterns. Analysis at the pairwise...
Ifije E. Ohiorhenuan, Jonathan D. Victor