1568 search results - page 206 / 314 » The problem of examination questions in algorithmics |
196
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
178
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
183
click to vote
ALT
2007
Springer
16 years 3 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
213
click to vote
SMA
2009
ACM
16 years 27 days ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
187
click to vote
ICPP
2008
IEEE
16 years 25 days ago
2008
IEEE
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...