Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

This work was supported by the National Natural Science Foundation of China, the Chinese Academy of Sciences, the National… Expand

Is this relevant?

2009

2009

htmlabstractIn this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

The Counting Constraint Satisfaction Problem (${\rm \#CSP}(\mathcal{H})$) over a finite relational structure $\mathcal{H}$ can be… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We give a complexity theoretic classification of the counting versions of so-called H-colouring problems for graphs H that may… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

We introduce a new notion of efficient reduction among computational problems. Classical reductions involve gadgets that map… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Mining maximal frequent itemsets is one of the most fundamental problems in data mining. In this paper we study the complexity… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

We study several versions of the shortest-path problem when the map is not known in advanced, but is specified dynamically. We… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

We develop polynomial time Monte-Carlo algorithms which produce good approximate solutions to enumeration problems for which it… Expand

Is this relevant?