Sciweavers

789 search results - page 47 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
CIKM
2008
Springer
14 years 11 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
15 years 7 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
15 years 11 months ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...
COMPSAC
2008
IEEE
15 years 4 months ago
An Adaptive Software Architecture Model Based on Component-Mismatches Detection and Elimination
Commercial-off-the-shelf components (COTS) are widely reused at present and black-box composition is the unique way to integrate them into the target system. However, various mism...
Shan Tang, Xin Peng, Yiming Lau, Wenyun Zhao, Zhix...
CEC
2010
IEEE
14 years 1 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis