Sciweavers

1952 search results - page 276 / 391
» Complete partitions of graphs
Sort
View
JCT
2006
69views more  JCT 2006»
15 years 6 months ago
The Bergman complex of a matroid and phylogenetic trees
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
Federico Ardila, Caroline J. Klivans
IGPL
2007
45views more  IGPL 2007»
15 years 6 months ago
On Positive Relational Calculi
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasize...
Renata P. de Freitas, Paulo A. S. Veloso, Sheila R...
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 6 months ago
sTeXIDE: An Integrated Development Environment for sTeX Collections
Authoring documents in MKM formats like OMDoc is a very tedious task. After years of working on a semantically annotated corpus of STEX documents (GenCS), we identified a set of co...
Constantin Jucovschi, Michael Kohlhase
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
16 years 1 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
MM
2004
ACM
195views Multimedia» more  MM 2004»
15 years 11 months ago
Hierarchical clustering of WWW image search results using visual, textual and link information
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
Deng Cai, Xiaofei He, Zhiwei Li, Wei-Ying Ma, Ji-R...