5100 search results - page 173 / 1020 » The Linear Complexity of a Graph |
SAS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
CDC
2009
IEEE
14 years 3 months ago
2009
IEEE
— Recent results on the control of linear systems subject to time-domain constraints could only handle the case of closed-loop poles that are situated on the real axis. As most c...
JMLR
2002
13 years 10 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
IISWC
2006
IEEE
14 years 4 months ago
2006
IEEE
Workload characterization involves the understanding of the relationship between workload configurations and performance characteristics. To better assess the complexity of worklo...
ANOR
2008
13 years 10 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...