A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Constructing Incremental Sequences in Graphs
2006
Algorithmic Operations Research
unpublished
Preserved Fulltext
We give general bounds on the value of this ratio and we prove that the problem of constructing an optimal incremental sequence cannot be solved approximately in polynomial time with an approximation ratio ...
This quantity captures the impact of the incremental constraint on the diameters of the groups in a sequence. ...
Non-approximability of constructing optimal incremental sequences In this section, we investigate the complexity of constructing optimal incremental sequences. ...
fatcat:ngfbmngq3ne63mcrb6kyi7hy4i
Incremental learning of full body motion primitives and their sequencing through human motion observation
2011
The international journal of robotics research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The motion primitive graph can then be used to construct motions, consisting of sequences of motion primitives. The approach is implemented and tested on the IRT humanoid robot. ...
At the same time, the relationship between motion primitives is learned via the construction of a motion primitive graph. ...
The constructed graph can then be used to generate sequences of primitives by concatenating a set of nodes connected in the graph, for example, by searching the graph for a valid path given a starting ...
doi:10.1177/0278364911426178
fatcat:uhljvqzigncovgnp7sgtzvkpe4
Incremental learning of full body motion primitives for humanoid robots
2008
Humanoids 2008 - 8th IEEE-RAS International Conference on Humanoid Robots
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The motion primitive graph can then be used to construct motions, consisting of sequences of motion primitives. The approach is implemented and tested on the IRT humanoid robot. ...
At the same time, the relationship between motion primitives is learned via the construction of a motion primitive graph. ...
The constructed graph can then be used to generate sequences of primitives by concatenating a set of nodes connected in the graph, for example, by searching the graph for a valid path given a starting ...
doi:10.1109/ichr.2008.4756000
dblp:conf/humanoids/KulicLON08
fatcat:f2olibbxzjhcdle4havyv3xyy4
AMR Parsing via Graph-Sequence Iterative Inference
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
in the output graph to construct the new concept. ...
We propose a new end-to-end model that treats AMR parsing as a series of dual decisions on the input sequence and the incrementally constructed graph. ...
Our method constructs an AMR graph incrementally in a nodeby-node fashion. ...
arXiv:2004.05572v2
fatcat:levfg6nhzvgydbghluqaqzo2fa
Kineograph
2012
Proceedings of the 7th ACM european conference on Computer Systems - EuroSys '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Kineograph is a distributed system that takes a stream of incoming data to construct a continuously changing graph, which captures the relationships that exist in the data feed. ...
To keep up with continuous updates on the graph, Kineograph includes an incremental graph-computation engine. ...
Acknowledgments We are in debt to Emre Kiciman, Sean McDirmid, and Vijayan Prabhakaran for the discussions and feedback on Kineograph. ...
doi:10.1145/2168836.2168846
dblp:conf/eurosys/ChengHKMWWYZZC12
fatcat:vcubaaywlzahxp35yye5yrqp4m
Robust Visual Tracking Using Sparse Discriminative Graph Embedding
2015
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
, which are selected using an incremental updating scheme. ...
than alternatives reported in the recent literature. key words: visual tracking, sparse subspace, discriminative graph ...
Acknowledgments This work was supported in part by the National Science Foundation of China under Grant 61273254 and 61371183. ...
doi:10.1587/transinf.2014edp7419
fatcat:m7jwcs2mpfhchaddx4hziae4ki
Efficiently Testing $$T$$ -Interval Connectivity in Dynamic Graphs
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Such a sequence is said to be Tinterval connected if for any t ∈ [1, δ − T + 1] all graphs in {G t , G t+1 , ..., G t+T −1 } share a common connected spanning subgraph. ...
In this paper, we consider the problem of deciding whether a given sequence G is T -interval connected for a given T . ...
As in the previous algorithms, the right ladders are constructed incrementally as the walk goes up, even though each graph G k [j] can be computed from G k−1 [j] ∩ G j+k−1 , because this prepares the ladders ...
doi:10.1007/978-3-319-18173-8_6
fatcat:cgspf3pqrnffdfzojpyvz5kyoi
Efficiently Testing T-Interval Connectivity in Dynamic Graphs
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Such a sequence is said to be T-interval connected if for any t∈ [1, δ-T+1] all graphs in {G_t,G_t+1,...,G_t+T-1} share a common connected spanning subgraph. ...
When considered from a global and discrete standpoint, these networks are often modelled as evolving graphs, i.e. a sequence of graphs G=(G_1,G_2,... ...
As in the previous algorithms, the right ladders are constructed incrementally as the walk goes up, even though each graph G k [j] can be computed from G k−1 [j] ∩ G j+k−1 , because this prepares the ladders ...
arXiv:1502.00089v3
fatcat:jvqzcusb6jal7nfhzn2sne4oiu
Incremental Learning Algorithm for Online Action Game System
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We have built an online action game system in which a non-player character (NPC) can incrementally learn sequences of action and combinations. ...
One of the limitations of computer opponents in action games is that the character AI is constructed in advance, and players may become bored quickly. ...
in the pool of graphs. ...
doi:10.1007/978-3-642-04052-8_51
fatcat:b5r2muefefawfdgtetnkopjvq4
Analysis and evaluation of address arithmetic capabilities in custom DSP architectures
1997
Proceedings of the 34th annual conference on Design automation conference - DAC '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Our objective in this paper is to provide a method for comprehensively analyzing the performance benefits and hardware cost due to an auto-increment/decrement feature that varies from ,l to +l, and allowing ...
result in minimum code area. ...
ACKNOWLEDGMENTS This research was supported in part by the Advanced Research Projects Agency under contract DABT63-94-C-0053 and in part by NSF contract MIP-9612632. ...
doi:10.1145/266021.266103
dblp:conf/dac/SudarsanamLD97
fatcat:jc6zlidfxba3jdsjpl53b5ghmm
Improving Offset Assignment on Embedded Processors Using Transformations
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
It finds a layout of variables in RAM, so that it is possible to subsume explicit address register manipulation instructions into other instructions as a post-increment or post-decrement operation. ...
In this paper, we present new code optimization techniques for embedded fixed point DSP processors which have limited on-chip program ROM and include indirect addressing modes using post-increment and ...
Ramanujam is supported in part by an NSF grant CCR-0073800 and by NSF Young Investigator Award CCR-9457768. ...
doi:10.1007/3-540-44467-x_33
fatcat:cbalp6a6yfbjppriuele2hw7ha
Improving Offset Assignment for Embedded Processors
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
It finds a layout of variables in RAM, so that it is possible to subsume explicit address register manipulation instructions into other instructions as a post-increment or post-decrement operation. ...
In this paper, we present new code optimization techniques for embedded fixed point DSP processors which have limited on-chip program ROM and include indirect addressing modes using post-increment and ...
Ramanujam is supported in part by an NSF grant CCR-0073800 and by NSF Young Investigator Award CCR-9457768. ...
doi:10.1007/3-540-45574-4_11
fatcat:yzu36p7j5fc4xczxhlnioeisxe
Online acquisition and visualization of motion primitives for humanoid robots
2009
RO-MAN 2009 - The 18th IEEE International Symposium on Robot and Human Interactive Communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The human demonstrator motion is captured in a motion capture studio. The continuous observation sequence is first partitioned into motion segments, using stochastic segmentation. ...
Motion segments are next incrementally clustered and organized into a hierarchical tree structure representing the known motion primitives. ...
This work was supported by the Japanese Society for the Promotion of Science Category S Grant-in-Aid for Scientific Research 20220001. ...
doi:10.1109/roman.2009.5326307
dblp:conf/ro-man/KulicIN09
fatcat:x3zo2rdy7rhivoujakzthoulka
User-Role Reachability Analysis of Evolving Administrative Role Based Access Control
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Detailed evaluations show that our incremental algorithms outperform the non-incremental algorithm in terms of execution time. ...
To the best of our knowledge, these are the first known incremental algorithms in literature for ARBAC analysis. ...
In-cFwd2 reuses the transition graph constructed in the previous analysis and incrementally updates the graph. ...
doi:10.1007/978-3-642-15497-3_28
fatcat:2ow66wzlofh5rahi3yh5snf7la
GRETA
2017
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
State-of-the-art systems process such queries in two steps. Namely, they first construct all trends and then aggregate them. ...
We define the GRETA graph to compactly encode all trends. Our GRETA runtime incrementally maintains the graph, while dynamically propagating aggregates along its edges. ...
The graph is constructed on-the-fly as events arrive (Algorithm 2). The graph compactly captures all matched trends and enables their incremental aggregation. Compact Event Trend Encoding. ...
doi:10.14778/3151113.3151120
fatcat:pi7ovb4skzhj3diyeazi2jbs3m
« Previous
Showing results 1 — 15 out of 124,258 results