Sciweavers

862 search results - page 89 / 173
» Generalized Variational Relation Problems with Applications
Sort
View
FOCS
2004
IEEE
14 years 18 days ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
14 years 9 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
LICS
2010
IEEE
13 years 6 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
WWW
2005
ACM
14 years 9 months ago
WEBCAP: a capacity planning tool for web resource management
A staggering number of multimedia applications are being introduced every day. Yet, the inordinate delays encountered in retrieving multimedia documents make it difficult to use t...
Sami Habib, Maytham Safar
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 3 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal