Sciweavers

14548 search results - page 2654 / 2910
» The Optimal Path-Matching Problem
Sort
View
SIGCOMM
2006
ACM
16 years 16 days ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
SIGECOM
2006
ACM
125views ECommerce» more  SIGECOM 2006»
16 years 16 days ago
Minimum payments that reward honest reputation feedback
Online reputation mechanisms need honest feedback to function effectively. Self interested agents report the truth only when explicit rewards offset the cost of reporting and th...
Radu Jurca, Boi Faltings
SIGIR
2006
ACM
16 years 16 days ago
Learning to advertise
Content-targeted advertising, the task of automatically associating ads to a Web page, constitutes a key Web monetization strategy nowadays. Further, it introduces new challenging...
Anísio Lacerda, Marco Cristo, Marcos Andr&e...
SPAA
2006
ACM
16 years 16 days ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
CVPR
2010
IEEE
16 years 7 days ago
Free-Form Mesh Tracking : a Patch-Based Approach
In this paper, we consider the problem of tracking nonrigid surfaces and propose a generic data-driven mesh deformation framework. In contrast to methods using strong prior models...
Cedric Cagniart, Edmond Boyer, Slobodan Ilic
« Prev « First page 2654 / 2910 Last » Next »