JMLR

2010

12 years 11 months ago
2010

In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...

FSTTCS

2010

Springer

13 years 2 months ago
2010

Springer

A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...

TON

2002

13 years 3 months ago
2002

In a communication network, a good rate allocation algorithm should reflect the utilities of the users while being fair. We investigate this fundamental problem of achieving the sy...

JC

2000

13 years 4 months ago
2000

Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...

TCS

2008

13 years 4 months ago
2008

Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...

JCST

2008

13 years 4 months ago
2008

In a question answering (QA) system, the fundamental problem is how to measure the distance between a question and an answer, hence ranking different answers. We demonstrate that s...

IJFCS

2008

13 years 4 months ago
2008

A fundamental problem in music is to classify songs according to their rhythm. A rhythm is represented by a sequence of "Quick" (Q) and "Slow" (S) symbols, whi...

CORR

2006

Springer

13 years 4 months ago
2006

Springer

A fundamental problem in artificial intelligence is that nobody really knows what intelligence is. The problem is especially acute when we need to consider artificial systems whic...

COGSCI

2006

13 years 4 months ago
2006

A fundamental problem in spoken language is the duality between the continuous aspects of phonetic performance and the discrete aspects of phonological competence. We study 2 inst...

ENTCS

2008

13 years 4 months ago
2008

The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...