Sciweavers

1381 search results - page 143 / 277
» Structural signatures for tree data structures
Sort
View
POPL
2012
ACM
13 years 5 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
JNW
2008
139views more  JNW 2008»
14 years 10 months ago
Large-Scale RTCP Feedback Optimization
Nowadays, multimedia streaming is a common service on the Internet including both fixed and mobile networks. The RTP protocol is usually used to transfer the media. The RTCP protoc...
Vit Novotny, Dan Komosny
NIPS
1990
14 years 11 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
LICS
2005
IEEE
15 years 3 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx