Sciweavers

62 search results - page 8 / 13
» Increasing the Gap between Descriptional Complexity and Algo...
Sort
View
WWW
2011
ACM
14 years 4 months ago
A self-training approach for resolving object coreference on the semantic web
An object on the Semantic Web is likely to be denoted with multiple URIs by different parties. Object coreference resolution is to identify “equivalent” URIs that denote the ...
Wei Hu, Jianfeng Chen, Yuzhong Qu
CGF
2010
149views more  CGF 2010»
14 years 9 months ago
Over Two Decades of Integration-Based, Geometric Flow Visualization
With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remain...
Tony McLoughlin, Robert S. Laramee, Ronald Peikert...
ASAP
1997
IEEE
156views Hardware» more  ASAP 1997»
15 years 1 months ago
Design methodology for digital signal processing
Improvements in semiconductor integration density and the resulting problem of having to manage designs of increasing complexity is an old one, but still current. The new challeng...
Gerhard Fettweis
99
Voted
ICASSP
2011
IEEE
14 years 1 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
ICALP
2009
Springer
15 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner