Sciweavers

234 search results - page 31 / 47
» An Introduction to Binary Search Trees and Balanced Trees
Sort
View
86
Voted
PR
2010
135views more  PR 2010»
14 years 4 months ago
Revisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
Cris L. Luengo Hendriks
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
14 years 11 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 1 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
ECCV
2002
Springer
15 years 11 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal
DLOG
2007
14 years 12 months ago
On Ordering Descriptions in a Description Logic
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...
Jeffrey Pound, Lubomir Stanchev, David Toman, Gran...