Sciweavers

2463 search results - page 85 / 493
» Rankings of Directed Graphs
Sort
View
IR
2010
13 years 7 months ago
A general approximation framework for direct optimization of information retrieval measures
Recently direct optimization of information retrieval (IR) measures becomes a new trend in learning to rank. Several methods have been proposed and the effectiveness of them has ...
Tao Qin, Tie-Yan Liu, Hang Li
TOG
2012
298views Communications» more  TOG 2012»
11 years 11 months ago
Tensor displays: compressive light field synthesis using multilayer displays with directional backlighting
We introduce tensor displays: a family of compressive light field displays comprising all architectures employing a stack of timemultiplexed, light-attenuating layers illuminated...
Gordon Wetzstein, Douglas Lanman, Matthew Hirsch, ...
ICCAD
2005
IEEE
106views Hardware» more  ICCAD 2005»
14 years 2 months ago
Fast balanced stochastic truncation via a quadratic extension of the alternating direction implicit iteration
— Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT pro...
Ngai Wong, Venkataramanan Balakrishnan
SIAMSC
2008
142views more  SIAMSC 2008»
13 years 9 months ago
A Fast Direct Solver for the Biharmonic Problem in a Rectangular Grid
We present a fast direct solver methodology for the Dirichlet biharmonic problem in a rectangle. The solver is applicable in the case of the second order Stephenson scheme [34] as ...
Matania Ben-Artzi, Jean-Pierre Croisille, Dalia Fi...
JAPLL
2006
114views more  JAPLL 2006»
13 years 9 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle