3547 search results - page 202 / 710 » Computers Seeing People |
133
click to vote
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
The design guideline avoid dependency cycles among modules was ļ¬rst alluded to by Parnas in 1978. Many tools have since been built to detect cyclic dependencies among a programā...
133
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
142
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
139
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
136
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur ā¦(logn) multiplicative distortion, which is as large as it can possib...