503 search results - page 77 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
132
Voted
IEAAIE
2009
Springer
15 years 10 months ago
2009
Springer
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
149
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
121
Voted
SIAMDM
2008
15 years 3 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
134
click to vote
CIVR
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
101
click to vote
KAIS
2006
15 years 3 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...