Sciweavers

993 search results - page 11 / 199
» Set Constraints on Regular Terms
Sort
View
ICCV
2003
IEEE
14 years 9 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
IJCV
2006
79views more  IJCV 2006»
13 years 7 months ago
Splines in Higher Order TV Regularization
Splines play an important role as solutions of various interpolation and approximation problems that minimize special functionals in some smoothness spaces. In this paper, we show ...
Gabriele Steidl, Stephan Didas, Julia Neumann
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 8 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
13 years 9 months ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...
SIGIR
2006
ACM
14 years 1 months ago
Semantic term matching in axiomatic approaches to information retrieval
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...
Hui Fang, ChengXiang Zhai