817 search results - page 70 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
MICCAI
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. This study presents a novel automatic approach for the identification of anatomical brain structures in magnetic resonance images (MRI). The method combines a fast multis...
ANOR
2011
13 years 11 days ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
ICRA
1999
IEEE
14 years 1 months ago
1999
IEEE
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...