Sciweavers

11160 search results - page 2111 / 2232
» Incompleteness in a General Setting
Sort
View
ACCV
2007
Springer
15 years 5 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
CIKM
2008
Springer
15 years 5 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
CLEF
2008
Springer
15 years 5 months ago
GeoCLEF 2008: The CLEF 2008 Cross-Language Geographic Information Retrieval Track Overview
GeoCLEF is an evaluation initiative for testing queries with a geographic specification in large set of text documents. GeoCLEF ran a regular track for the third time within the C...
Thomas Mandl, Paula Carvalho, Giorgio Maria Di Nun...
CLEF
2008
Springer
15 years 5 months ago
Overview of VideoCLEF 2008: Automatic Generation of Topic-Based Feeds for Dual Language Audio-Visual Content
The VideoCLEF track, introduced in 2008, aims to develop and evaluate tasks related to analysis of and access to multilingual multimedia content. In its first year, VideoCLEF pilo...
Martha Larson, Eamonn Newman, Gareth J. F. Jones
COCOA
2008
Springer
15 years 5 months ago
Simplicial Powers of Graphs
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
Andreas Brandstädt, Van Bang Le
« Prev « First page 2111 / 2232 Last » Next »