6105 search results - page 874 / 1221 » A Parallel Algorithm for Bound-Smoothing |
173
click to vote
PPAM
2007
Springer
16 years 26 days ago
2007
Springer
Nowadays, capturing the knowledge in ontological structures is one of the primary focuses of the semantic web research. To exploit the knowledge from the vast quantity of existing ...
185
click to vote
DATE
2006
IEEE
16 years 24 days ago
2006
IEEE
This paper presents a new operation chaining reconfigurable scheduling algorithm (CRS) based on list scheduling that maximizes instruction level parallelism available in distribut...
183
click to vote
ISORC
2006
IEEE
16 years 22 days ago
2006
IEEE
Service overlays that support distributed stream processing applications are increasingly being deployed in wide-area environments. The inherent heterogeneous, dynamic and large-s...
178
click to vote
APGV
2006
ACM
16 years 21 days ago
2006
ACM
This paper describes a new technique to visualize 2D flow fields with a sparse collection of dots. A cognitive model proposed by Kent Stevens describes how spatially local con...
174
click to vote
CSFW
2005
IEEE
16 years 11 days ago
2005
IEEE
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...