Sciweavers

2087 search results - page 154 / 418
» Computation of class numbers of quadratic number fields
Sort
View
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
14 years 8 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
14 years 8 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
86
Voted
CDC
2010
IEEE
210views Control Systems» more  CDC 2010»
14 years 5 months ago
Advances in moving horizon estimation for nonlinear systems
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...
PODC
2011
ACM
14 years 27 days ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
3DIM
2011
IEEE
13 years 10 months ago
Visual Hull from Imprecise Polyhedral Scene
—We present a framework to compute the visual hull of a polyhedral scene, in which the vertices of the polyhedra are given with some imprecision. Two kinds of visual event surfac...
Peng He, Abbas Edalat