5180 search results - page 324 / 1036 » Concurrency, Time, and Constraints |
174
click to vote
ICML
2010
IEEE
15 years 7 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...
167
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
154
click to vote
SCL
2008
15 years 6 months ago
2008
Significant progress in control design has been achieved by the use of nonsmooth and semiinfinite mathematical programming techniques. In contrast with LMI or BMI approaches, thes...
194
click to vote
ICWS
2010
IEEE
15 years 5 months ago
2010
IEEE
The service-oriented approach is becoming more and more popular to integrate highly heterogeneous systems. Web services are the natural evolution of conventional middleware techno...
320
click to vote
SOFTCOMP
2010
15 years 5 months ago
2010
Abstract This paper presents an extension of MOVICAB-IDS, a Hybrid Intelligent Intrusion Detection System characterized by incorporating temporal control to enable real-time proces...