19320 search results - page 269 / 3864 » On the complexity of computing determinants |
167
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
181
click to vote
GRID
2000
Springer
15 years 10 months ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
186
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
185
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
196
click to vote
WSCG
2003
15 years 8 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...