Sciweavers

1487 search results - page 80 / 298
» The Computational Complexity of Link Building
Sort
View
CICLING
2005
Springer
15 years 9 months ago
Putting Pieces Together: Combining FrameNet, VerbNet and WordNet for Robust Semantic Parsing
Abstract. This paper describes our work in integrating three different lexical resources: FrameNet, VerbNet, and WordNet, into a unified, richer knowledge-base, to the end of ena...
Lei Shi, Rada Mihalcea
JUCS
2010
117views more  JUCS 2010»
15 years 2 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
PE
2007
Springer
112views Optimization» more  PE 2007»
15 years 3 months ago
Multicast inference of temporal loss characteristics
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
Vijay Arya, Nick G. Duffield, Darryl Veitch
CHI
2003
ACM
16 years 4 months ago
Dynamic query sliders vs. brushing histograms
Dynamic queries facilitate exploration of information through real-time visual display of both query formulation and results. Dynamic query sliders are linked to the main visualiz...
Qing Li, Xiaofeng Bao, Chen Song, Jinfei Zhang, Ch...
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...