Sciweavers

1626 search results - page 224 / 326
» Hybrid computing algorithm in representing solid model
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 3 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
135
Voted
SDM
2009
SIAM
223views Data Mining» more  SDM 2009»
16 years 13 days ago
Context Aware Trace Clustering: Towards Improving Process Mining Results.
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
EOR
2010
87views more  EOR 2010»
15 years 3 months ago
On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks
-- The classical Wardrop System Optimum (SO) assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of...
Frederico R. B. Cruz, Tom Van Woensel, James MacGr...
SAC
2011
ACM
14 years 6 months ago
ImageAlert: credibility analysis of text-image pairs on the web
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
Yusuke Yamamoto, Katsumi Tanaka
117
Voted
BMCBI
2008
79views more  BMCBI 2008»
15 years 3 months ago
A high-throughput pipeline for designing microarray-based pathogen diagnostic assays
Background: We present a methodology for high-throughput design of oligonucleotide fingerprints for microarray-based pathogen diagnostic assays. The oligonucleotide fingerprints, ...
Ravi Vijaya Satya, Nela Zavaljevski, Kamal Kumar, ...