Sciweavers

265 search results - page 16 / 53
» Properties and computations of matrix pseudospectra
Sort
View
IFIP
2004
Springer
15 years 3 months ago
Imperfectness of Data for STS-Based Physical Mapping
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
Hiro Ito, Kazuo Iwama, Takeyuki Tamura
PODC
2006
ACM
15 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
BIRTHDAY
2010
Springer
14 years 11 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
AMEC
2003
Springer
15 years 3 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
TKDE
2008
121views more  TKDE 2008»
14 years 9 months ago
Kernel Uncorrelated and Regularized Discriminant Analysis: A Theoretical and Computational Study
Linear and kernel discriminant analyses are popular approaches for supervised dimensionality reduction. Uncorrelated and regularized discriminant analyses have been proposed to ove...
Shuiwang Ji, Jieping Ye