Sciweavers

264 search results - page 38 / 53
» Making Argumentation More Believable
Sort
View
CVPR
2011
IEEE
13 years 3 months ago
Tracking 3D Human Pose with Large Root Node Uncertainty
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...
Ben Daubney, Xianghua Xie
SIGSOFT
2003
ACM
14 years 8 months ago
Protecting C programs from attacks via invalid pointer dereferences
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
Suan Hsi Yong, Susan Horwitz
RTAS
2007
IEEE
14 years 1 months ago
Full Duplex Switched Ethernet for Next Generation "1553B"-Based Applications
Over the last thirty years, the MIL-STD 1553B data bus has been used in many embedded systems, like aircrafts, ships, missiles and satellites. However, the increasing number and c...
Ahlem Mifdaoui, Fabrice Frances, Christian Fraboul
ATAL
2005
Springer
14 years 1 months ago
Protocol synthesis with dialogue structure theory
Inspired by computational linguistic approaches to annotate the structures that occur in human dialogue, this paper describes a technique which encodes these structures as transfo...
Jarred McGinnis, David Robertson, Christopher Walt...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 11 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...