Sciweavers

1772 search results - page 124 / 355
» Classifying Problems into Complexity Classes
Sort
View
NETWORKS
2011
15 years 1 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
ICASSP
2009
IEEE
16 years 1 months ago
Part-of-speech histograms for genre classification of text
This work addresses the problem of classifying the genre of text, which is useful for a variety of language processing problems. We propose statistics of POS histograms as classiï...
Sergey Feldman, Marius A. Marin, Mari Ostendorf, M...
CVPR
2005
IEEE
16 years 8 months ago
Local Discriminant Embedding and Its Variants
We present a new approach, called local discriminant embedding (LDE), to manifold learning and pattern classification. In our framework, the neighbor and class relations of data a...
Hwann-Tzong Chen, Huang-Wei Chang, Tyng-Luh Liu
CAISE
2004
Springer
15 years 11 months ago
An Ontologically Well-Founded Profile for UML Conceptual Models
UML class diagrams can be used as a language for expressing a conceptual model of a domain. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL) ...
Giancarlo Guizzardi, Gerd Wagner, Nicola Guarino, ...
PODC
2012
ACM
13 years 8 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...