Sciweavers

2087 search results - page 186 / 418
» Computation of class numbers of quadratic number fields
Sort
View
MFCS
2009
Springer
16 years 1 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
NCA
2007
IEEE
16 years 23 days ago
Discovering Web Workload Characteristics through Cluster Analysis
In this paper we present clustering analysis of sessionbased Web workloads of eight Web servers using the intrasession characteristics (i.e., number of requests per session, sessi...
Fengbin Li, Katerina Goseva-Popstojanova, Arun Ros...
CVPR
2006
IEEE
16 years 16 days ago
Nonlinear Mean Shift for Clustering over Analytic Manifolds
The mean shift algorithm is widely applied for nonparametric clustering in Euclidean spaces. Recently, mean shift was generalized for clustering on matrix Lie groups. We further e...
Raghav Subbarao, Peter Meer
STACS
1999
Springer
15 years 10 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
15 years 10 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara