Sciweavers

705 search results - page 120 / 141
» Approximating Extended Answer Sets
Sort
View
ECCC
2007
147views more  ECCC 2007»
14 years 9 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
IPSN
2009
Springer
15 years 4 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
RECOMB
2004
Springer
15 years 10 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
DBVIS
1993
101views Database» more  DBVIS 1993»
15 years 1 months ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
NIPS
2007
14 years 11 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....