9736 search results - page 24 / 1948 » How Fast Can We Compute Products |
133
click to vote
JISE
2006
15 years 4 months ago
2006
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
ICALT
2006
IEEE
15 years 10 months ago
2006
IEEE
1 In this paper we show how descriptive markup technologies can help teachers in the production of learning content that later could be used for many different purposes with differ...
124
click to vote
ICARCV
2008
IEEE
15 years 11 months ago
2008
IEEE
—In order to navigate safely, it is important to detect and to react to a potentially dangerous situation. Such a situation can be underlined by a judicious use of the locations ...
149
click to vote
AIR
2004
15 years 4 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
123
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...