Filters








43,338 Hits in 5.7 sec

t-kernel

Lin Gu, John A. Stankovic
2006 Proceedings of the 4th international conference on Embedded networked sensor systems - SenSys '06  
To solve this problem, we design a new OS kernel, the t-kernel, to perform extensive code modification at load time.  ...  The modified code and the OS work in a collaborative way supporting the aforementioned features.  ...  For example, the VigilNet system uses a memory overlay scheme to reuse memory areas, taking advantage of the knowledge on the state transitions of the application.  ... 
doi:10.1145/1182807.1182809 dblp:conf/sensys/GuS06 fatcat:u4od3kuuabchrjtzwkbwh3q7f4

DPLL(T): Fast Decision Procedures [chapter]

Harald Ganzinger, George Hagen, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli
2004 Lecture Notes in Computer Science  
We describe this DPLL(T ) scheme, the interface between DPLL(X) and Solver T , the architecture of DPLL(X), and our solver for EUF, which includes incremental and backtrackable congruence closure algorithms  ...  Here we propose a new approach, namely a general DPLL(X) engine, whose parameter X can be instantiated with a specialized solver Solver T for a given theory T , thus producing a system DPLL(T ).  ...  A DPLL(X) scheme was introduced and informally described in [NO03] .  ... 
doi:10.1007/978-3-540-27813-9_14 fatcat:eoc6hlzserd3hbjnlhxvtg6upm

A fast ACSU architecture for Viterbi decoder using T-algorithm

Jinjin He, Huaping Liu, Zhongfeng Wang
2009 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers  
It is essential to use T-algorithm in Viterbi decoders to prune significant portions of the trellis states to dramatically reduce power consumption.  ...  Modern digital communication systems usually employ convolutional codes with large constraint length for good decoding performance, which leads to large complexity and power consumption in Viterbi decoders  ...  Two-step pre-computation We again need to analyze the trellis transition of the original code.  ... 
doi:10.1109/acssc.2009.5470119 fatcat:t55xffpbqnellcyq7rby7gqfqi

High Speed ACSU Architecture for Viterbi Decoder Using T-Algorithm

Atish A. Peshattiwar, TEJASWINI PANSE
2013 International Journal of Electronics and Electical Engineering  
Through optimization at both algorithm level and architecture level, the new architecture greatly shortens the long critical path introduced by the conventional T-algorithm.  ...  Two-step pre-computation We again need to analyze the trellis transition of the original code.  ...  This information allows us to obtain the 2-step pre-computation data path. This process is straightforward, although the mathematical details are tedious.  ... 
doi:10.47893/ijeee.2013.1048 fatcat:jwexgnhicvhjtgtocttl42vyn4

AT&T Research at TRECVID 2006

Zhu Liu, David C. Gibbon, Eric Zavesky, Behzad Shahraray, Patrick Haffner
2006 TREC Video Retrieval Evaluation  
TRECVID (TREC Video Retrieval Evaluation) is sponsored by NIST to encourage research in digital video indexing and retrieval.  ...  The AT&T SBD system is highly effective and its evaluation results are among the best.  ...  For the rushes exploitation task, we demonstrated a content based video browsing and query system, which was built on the MIRACLE (Multimedia information retrieval by content) platform from AT&T Labs and  ... 
dblp:conf/trecvid/0001GZSH06 fatcat:z55nnyar7bcfbo7sjdpqhrgjte

ACSU Architecture with High Clock Speed for Viterbi Decoder Using T-Algorithm

Atish A. Peshattiwar, Shashant Jaykar, Tejaswini G. Panse
2012 2012 International Conference on Communication Systems and Network Technologies  
Through optimization at both algorithm level and architecture level, the new architecture greatly shortens the long critical path introduced by the conventional T-algorithm.  ...  Two-step pre-computation We again need to analyze the trellis transition of the original code.  ...  This information allows us to obtain the 2-step pre-computation data path. This process is straightforward, although the mathematical details are tedious.  ... 
doi:10.1109/csnt.2012.125 fatcat:ufaazftdpffcfp52psrp74pl5u

Paradigm Shifts in Video Technologies: Introduction to T-CSVT Future Special Issues

2014 IEEE transactions on circuits and systems for video technology (Print)  
Let us elaborate on each of these trends.  ...  A new theory on distributed coding and distributed processing is also emerging to enable independent compression and processing of visual signals with significantly reduced communication overhead, but  ...  Another important area of research is the development of new communication schemes that jointly consider source coding, channel coding, and even modulation for wireless communication based on visual signal  ... 
doi:10.1109/tcsvt.2014.2332410 fatcat:zdevzkgx6bdkxik5wcxbh2ad3i

Efficient audio stream segmentation via the combined T/sup 2/ statistic and Bayesian information criterion

Bowen Zhou, J.H.L. Hansen
2005 IEEE Transactions on Speech and Audio Processing  
In many speech and audio applications, it is first necessary to partition and classify acoustic events prior to voice coding for communication or speech recognition for spoken document retrieval.  ...  The proposed algorithm also incorporates a variable-size increasing window scheme and a skip-frame test.  ...  Chen for providing more extensive information about their original BIC segmentation results [6] , and the anonymous reviewers who provided constructive feedback for this paper.  ... 
doi:10.1109/tsa.2005.845790 fatcat:pypkulfru5g5nk3tc5b54wj75u

Optimal foraging in semantic memory

Thomas T. Hills, Michael N. Jones, Peter M. Todd
2012 Psychological review  
Do humans search in memory using dynamic local-to-global search strategies similar to those that animals use to forage between patches in space?  ...  We found evidence for local structure (i.e., patches) in memory search and patch depletion preceding dynamic local-to-global transitions between patches.  ...  To represent the structure of semantic memory, we use both hand-coded (Troyer) and statistically derived (BEAGLE) schemes.  ... 
doi:10.1037/a0027373 pmid:22329683 fatcat:le7ahuyb6neghgyznj7deyxcga

Una Propuesta de T-Learning: Usando Planificación, Inteligencia Artificial y Razonamiento Ontológico

Íngrid Durley Torres-Pardo, Jaime Alberto Guzmán-Luna, Miguel Alberto Becerra
2013 Lámpsakos  
Este artículo se centra en proponer cómo utilizar las técnicas de planificación de inteligencia artificial en conjunto con el razonamiento ontológico en entornos t-learning, con el fin de: i) lograr automatizar  ...  The use of an ontology-based indexing scheme is a crucial element in the approach. It provides a unique vocabulary for query retrieval and reasoning on LO.  ...  LO are considered as documents and search engines apply information retrieval methods, to retrieve the LOs that satisfy the user query.  ... 
doi:10.21501/21454086.980 fatcat:gu7fdpwatffbvejmruygqzhko4

Retrieving video data via motion tracks of content symbols

Tim T. Y. Wai, Arbee L. P. Chen
1997 Proceedings of the sixth international conference on Information and knowledge management - CIKM '97  
In content-based retrieval, the motion track of a symbol object can be used as an index of video databases. Query processing based on such index can be treated as a curve matching problem.  ...  In the second approach, both the motion track index and the query curve are modeled as a combination of peaks and each peak is coded according to its orientation, angle and temporal information.  ...  Therefore, by combfning the three coding schemes together, the query processing lime turns out to be less than one third of that using the first way.  ... 
doi:10.1145/266714.266872 dblp:conf/cikm/WaiC97 fatcat:4eerri7hanadfjxa34qs7geuo4

Toward Rigorous Comprehension of Biological Complexity: Modeling, Execution, and Visualization of Thymic T-Cell Maturation

S. Efroni
2003 Genome Research  
First, we use the visual language of Statecharts, which makes specification precise, legible, and executable on computers.  ...  T-cell maturation in the thymus is a telling example of the accumulation of experimental data into a large disconnected data set.  ...  METHODS The scheme we use is represented in Figure 9 . For a detailed description, see Harel et al. (2003) .  ... 
doi:10.1101/gr.1215303 pmid:14597657 pmcid:PMC403768 fatcat:lpoueh2jfzaddifnsxbhkihg2u

Linepak: Algorithms for modeling spectral transmittance and radiance

Larry L. Gordley, Benjamin T. Marshall, D. Allen Chu
1994 Journal of Quantitative Spectroscopy and Radiative Transfer  
Numerical techniques and applications are described with examples that include a simulated limb scan retrieval and comparison to other codes.  ...  A set of subroutines has been written for use in developing spectral models, with emphasis on the Earth's atmosphere.  ...  Russell III of NASA/Langley Research Center for the opportunity to apply these codes to the HALOE data analysis, Dr Martin M.  ... 
doi:10.1016/0022-4073(94)90025-6 fatcat:c7kiplrl7bd2nnl75somhl4ia4

T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion [article]

Jaehun Jung, Jinhong Jung, U Kang
2020 arXiv   pre-print
In this paper, we propose T-GAP, a novel model for TKG completion that maximally utilizes both temporal information and graph structure in its encoder and decoder.  ...  Through extensive qualitative analyses, we also show that T-GAP enjoys from transparent interpretability, and follows human intuition in its reasoning process.  ...  Introduction Knowledge graph (KG), due to its expressiveness over structured knowledge, has been widely used in various applications including recommender system (Wang et al. 2019) , information retrieval  ... 
arXiv:2012.10595v1 fatcat:dhacrxbmfbcuteqtziidogs2rq

T-Chain: A General Incentive Scheme for Cooperative Computing

Kyuyong Shin, Carlee Joe-Wong, Sangtae Ha, Yung Yi, Injong Rhee, Douglas Reeves
2015 2015 IEEE 35th International Conference on Distributed Computing Systems  
T-Chain is distributed and simple to implement, as no trusted third party is required to monitor or enforce the scheme, nor is there any reliance on reputation information or tokens.  ...  The proposed incentive scheme, called Triangle Chaining (T-Chain), enforces reciprocity to minimize the exploitable aspects of other schemes that allow free-riding.  ...  These schemes encourage or enforce reciprocity based on direct experience, on information indirectly obtained (e.g., reputation), or on the use of encryption.  ... 
doi:10.1109/icdcs.2015.25 dblp:conf/icdcs/ShinJHYRR15 fatcat:mztl33xv5naljeokplowaz4u64
« Previous Showing results 1 — 15 out of 43,338 results