1469 search results - page 200 / 294 » Approximate polynomial decomposition |
163
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
173
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
179
click to vote
SSD
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
159
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
145
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...