796 search results - page 40 / 160 » Approximating the centroid is hard |
DATE
2009
IEEE
13 years 11 months ago
2009
IEEE
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
CSMR
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--In contrast to conventional multi-page Web applications, an Ajax application is developed as a single-page application in which content and structure are changed at runti...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
AAAI
2010
13 years 7 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...