Sciweavers

1888 search results - page 45 / 378
» Proof theory and computational analysis
Sort
View
VLDB
2007
ACM
161views Database» more  VLDB 2007»
14 years 7 months ago
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
Feifei Li, Ke Yi, Marios Hadjieleftheriou, George ...
RTA
2010
Springer
13 years 11 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
TON
2010
141views more  TON 2010»
13 years 5 months ago
Weighted spectral distribution for internet topology analysis: theory and applications
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...
JSYML
2002
92views more  JSYML 2002»
13 years 7 months ago
Groundwork for Weak Analysis
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
António M. Fernandes, Fernando Ferreira
COMPGEOM
2006
ACM
14 years 1 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...