Sciweavers

7495 search results - page 1113 / 1499
» Intelligent Document Processing
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary optimization of multistage interconnection networks performance
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
Jirí Jaros
IEAAIE
2009
Springer
16 years 1 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
ISMIS
2009
Springer
16 years 1 months ago
Discovering Structured Event Logs from Unstructured Audit Trails for Workflow Mining
Workflow mining aims to find graph-based process models based on activities, emails, and various event logs recorded in computer systems. Current workflow mining techniques mainly ...
Liqiang Geng, Scott Buffett, Bruce Hamilton, Xin W...
IVA
2009
Springer
16 years 1 months ago
Human-Centered Distributed Conversational Modeling: Efficient Modeling of Robust Virtual Human Conversations
Currently, applications that focus on providing conversations with virtual humans require extensive work to create robust conversational models. We present a new approach called Hu...
Brent Rossen, Scott Lind, Benjamin Lok
« Prev « First page 1113 / 1499 Last » Next »