4110 search results - page 93 / 822 » Efficient algorithms for the 2-gathering problem |
115
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
129
click to vote
BIOCOMP
2006
15 years 5 months ago
2006
: It is a very active research field to predict protein functions and active sites by protein surface patches. It is especially challengeable to predict the active sites by structu...
106
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
135
click to vote
AAAI
2010
15 years 5 months ago
2010
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
150
click to vote
ESANN
2006
15 years 5 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...