3591 search results - page 150 / 719 » Typing linear constraints |
140
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
123
click to vote
SIAMCO
2000
15 years 5 months ago
2000
We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in given class, for...
136
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
141
click to vote
HYBRID
2010
Springer
16 years 6 days ago
2010
Springer
In this paper we study one-clock priced timed automata in which prices can grow linearly ( ˙p = k) or exponentially ( ˙p = kp), with discontinuous updates on edges. We propose E...
140
click to vote
STACS
2009
Springer
16 years 4 days ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...