522 search results - page 25 / 105 » On the Hardness of the Noncommutative Determinant |
MDM
2010
Springer
14 years 20 days ago
2010
Springer
—Range query processing is an important technology in spatial databases. Current studies mainly focus on range queries in outdoor space based on the Euclidean or network distance...
CAIP
2009
Springer
14 years 16 days ago
2009
Springer
We introduce a new method to determine the flow field of an image sequence using multi-scale anchor points. These anchor points manifest themselves in the scale-space representat...
MFCS
2001
Springer
14 years 10 days ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
BIBE
2004
IEEE
13 years 11 months ago
2004
IEEE
In microarray gene expression data, clusters may hide in subspaces. Traditional clustering algorithms that make use of similarity measurements in the full input space may fail to ...
DDECS
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...