Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DM
2006
68views more  DM 2006»
11 years 9 months ago
A note on maximally repeated sub-patterns of a point set
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
Véronique Cortier, Xavier Goaoc, Mira Lee, ...
ENTCS
2008
99views more  ENTCS 2008»
11 years 9 months ago
SPPF-Style Parsing From Earley Recognisers
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
Elizabeth Scott
ENTCS
2008
142views more  ENTCS 2008»
11 years 9 months ago
Worst Case Reaction Time Analysis of Concurrent Reactive Programs
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
Marian Boldt, Claus Traulsen, Reinhard von Hanxled...
COMGEO
2008
ACM
11 years 9 months ago
Optimal core-sets for balls
Given a set of points P Rd and value > 0, an -core-set S P has the property that the smallest ball containing S is within of the smallest ball containing P. This paper shows ...
Mihai Badoiu, Kenneth L. Clarkson
AUTOMATICA
2010
104views more  AUTOMATICA 2010»
11 years 9 months ago
Identification for robust H2 deconvolution filtering
This paper addresses robust deconvolution filtering when the system and noise dynamics are obtained by parametric system identification. Consistent with standard identification me...
Xavier Bombois, Håkan Hjalmarsson, Gé...
CNIS
2006
11 years 11 months ago
An efficient hybrid algorithm for multidimensional packet classification
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...
Yaxuan Qi, Jun Li
UAI
2008
11 years 11 months ago
Almost Optimal Intervention Sets for Causal Discovery
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
Frederick Eberhardt
NETWORKING
2008
11 years 11 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
IJCAI
2007
11 years 11 months ago
The Ins and Outs of Critiquing
Eliminating previously recommended products in critiquing limits the choices available to users when they attempt to navigate back to products they critiqued earlier in the dialog...
David McSherry, David W. Aha
CCCG
2010
11 years 11 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
books