Sciweavers

2370 search results - page 58 / 474
» A Structured Set of Higher-Order Problems
Sort
View
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
12 years 11 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
JCST
2010
109views more  JCST 2010»
13 years 3 months ago
The Inverse Classification Problem
In this paper, we examine an emerging variation of the classification problem, which is known as the inverse classification problem. In this problem, we determine the features to b...
Charu C. Aggarwal, Chen Chen, Jiawei Han
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 8 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
COCOON
2005
Springer
13 years 11 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...