2188 search results - page 53 / 438 » Instance-Optimal Geometric Algorithms |
197
click to vote
ISVC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The function of a protein is dependent on whether and how it can interact with various ligands. Therefore, an accurate prediction of protein-ligand interactions is paramo...
210
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
196
click to vote
SCCC
2005
IEEE
16 years 18 days ago
2005
IEEE
— Fuzzy clustering methods have been widely used in many applications. These methods, including fuzzy k-means and Expectation Maximization, allow an object to be assigned to mult...
182
Voted
WAW
2004
Springer
16 years 11 days ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
149
click to vote
AAECC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...