Sciweavers

534 search results - page 50 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
ICC
2007
IEEE
290views Communications» more  ICC 2007»
14 years 2 months ago
Mobile Position Tracking by TDOA-Doppler Hybrid Estimation in Mobile Cellular System
Abstract— An effective method is presented for position tracking of a moving mobile terminal (MT). The method is based on time/distance difference of arrival (TDOA) estimation an...
Wen Pan, Jiang Wu, Zhanjun Jiang, Yan Wang, Xiaohu...
ICICS
2005
Springer
14 years 1 months ago
Network Vulnerability Analysis Through Vulnerability Take-Grant Model (VTG)
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
Hamid Reza Shahriari, Reza Sadoddin, Rasool Jalili...
CSL
2001
Springer
14 years 6 days ago
Markov's Principle for Propositional Type Theory
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. ...
Alexei Kopylov, Aleksey Nogin
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 1 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ADBIS
2004
Springer
224views Database» more  ADBIS 2004»
14 years 1 months ago
Using Ontologies for Database Query Reformulation
Abstract. Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integrati...
Chokri Ben Necib, Johann Christoph Freytag