Institution
Microsoft
Company•Redmond, Washington, United States•
About: Microsoft is a company organization based out in Redmond, Washington, United States. It is known for research contribution in the topics: User interface & Context (language use). The organization has 49501 authors who have published 86900 publications receiving 4195429 citations. The organization is also known as: MS & MSFT.
Topics: User interface, Context (language use), Object (computer science), Computer science, Cloud computing
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A new class of support vector algorithms for regression and classification that eliminates one of the other free parameters of the algorithm: the accuracy parameter in the regression case, and the regularization constant C in the classification case.
Abstract: We propose a new class of support vector algorithms for regression and classification. In these algorithms, a parameter ν lets one effectively control the number of support vectors. While this can be useful in its own right, the parameterization has the additional benefit of enabling us to eliminate one of the other free parameters of the algorithm: the accuracy parameter epsilon in the regression case, and the regularization constant C in the classification case. We describe the algorithms, give some theoretical results concerning the meaning and the choice of ν, and report experimental results.
2,737 citations
••
26 Jun 2006TL;DR: A spatially adaptive multiscale algorithm whose time and space complexities are proportional to the size of the reconstructed model, and which reduces to a well conditioned sparse linear system.
Abstract: We show that surface reconstruction from oriented points can be cast as a spatial Poisson problem. This Poisson formulation considers all the points at once, without resorting to heuristic spatial partitioning or blending, and is therefore highly resilient to data noise. Unlike radial basis function schemes, our Poisson approach allows a hierarchy of locally supported basis functions, and therefore the solution reduces to a well conditioned sparse linear system. We describe a spatially adaptive multiscale algorithm whose time and space complexities are proportional to the size of the reconstructed model. Experimenting with publicly available scan data, we demonstrate reconstruction of surfaces with greater detail than previously achievable.
2,712 citations
••
01 Sep 1999TL;DR: Compared with classical techniques which use expensive equipment, such as two or three orthogonal planes, the proposed technique is easy to use and flexible, and advances 3D computer vision one step from laboratory environments to real-world use.
Abstract: Proposes a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled. The proposed procedure consists of a closed-form solution followed by a nonlinear refinement based on the maximum likelihood criterion. Both computer simulation and real data have been used to test the proposed technique, and very good results have been obtained. Compared with classical techniques which use expensive equipment, such as two or three orthogonal planes, the proposed technique is easy to use and flexible. It advances 3D computer vision one step from laboratory environments to real-world use. The corresponding software is available from the author's Web page ( ).
2,661 citations
••
26 Sep 2004TL;DR: A new metric for routing in multi-radio, multi-hop wireless networks with stationary nodes called Weighted Cumulative ETT (WCETT) significantly outperforms previously-proposed routing metrics by making judicious use of the second radio.
Abstract: We present a new metric for routing in multi-radio, multi-hop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks.The goal of the metric is to choose a high-throughput path between a source and a destination. Our metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link. The individual link weights are combined into a path metric called Weighted Cumulative ETT (WCETT) that explicitly accounts for the interference among links that use the same channel. The WCETT metric is incorporated into a routing protocol that we call Multi-Radio Link-Quality Source Routing.We studied the performance of our metric by implementing it in a wireless testbed consisting of 23 nodes, each equipped with two 802.11 wireless cards. We find that in a multi-radio environment, our metric significantly outperforms previously-proposed routing metrics by making judicious use of the second radio.
2,633 citations
•
01 Dec 2008
TL;DR: Markov Chains and Mixing Times as mentioned in this paper is an introduction to the modern approach to the theory of Markov chains and its application in the field of probability theory and linear algebra, where the main goal is to determine the rate of convergence of a Markov chain to the stationary distribution.
Abstract: This book is an introduction to the modern approach to the theory of Markov chains. The main goal of this approach is to determine the rate of convergence of a Markov chain to the stationary distribution as a function of the size and geometry of the state space. The authors develop the key tools for estimating convergence times, including coupling, strong stationary times, and spectral methods. Whenever possible, probabilistic methods are emphasized. The book includes many examples and provides brief introductions to some central models of statistical mechanics. Also provided are accounts of random walks on networks, including hitting and cover times, and analyses of several methods of shuffling cards. As a prerequisite, the authors assume a modest understanding of probability theory and linear algebra at an undergraduate level. ""Markov Chains and Mixing Times"" is meant to bring the excitement of this active area of research to a wide audience.
2,573 citations
Authors
Showing all 49603 results
Name | H-index | Papers | Citations |
---|---|---|---|
P. Chang | 170 | 2154 | 151783 |
Andrew Zisserman | 167 | 808 | 261717 |
Alexander S. Szalay | 166 | 936 | 145745 |
Darien Wood | 160 | 2174 | 136596 |
Xiang Zhang | 154 | 1733 | 117576 |
Vivek Sharma | 150 | 3030 | 136228 |
Rajesh Kumar | 149 | 4439 | 140830 |
Bernhard Schölkopf | 148 | 1092 | 149492 |
Thomas S. Huang | 146 | 1299 | 101564 |
Christopher D. Manning | 138 | 499 | 147595 |
Nicolas Berger | 137 | 1581 | 96529 |
Georgios B. Giannakis | 137 | 1321 | 73517 |
Luc Van Gool | 133 | 1307 | 107743 |
Eric Horvitz | 133 | 914 | 66162 |
Xiaoou Tang | 132 | 553 | 94555 |