Sciweavers

1887 search results - page 45 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
WWW
2009
ACM
14 years 8 months ago
Efficient overlap and content reuse detection in blogs and online news articles
The use of blogs to track and comment on real world (political, news, entertainment) events is growing. Similarly, as more individuals start relying on the Web as their primary in...
Jong Wook Kim, Jun'ichi Tatemura, K. Selçuk...
CGF
2008
227views more  CGF 2008»
13 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
13 years 11 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
TIP
1998
129views more  TIP 1998»
13 years 7 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
AMC
2008
106views more  AMC 2008»
13 years 7 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido