1431 search results - page 178 / 287 » The complexity of random ordered structures |
139
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
146
click to vote
ECCV
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
124
click to vote
SSDBM
2003
IEEE
15 years 8 months ago
2003
IEEE
MoBIoS is a specialized database management system whose storage manager is based on metric-space indexing, and whose query language entails biological data types. When relational...
120
click to vote
SAGA
2001
Springer
15 years 8 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
130
Voted
IJCAI
2007
15 years 4 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...