Sciweavers

2834 search results - page 18 / 567
» Representing Trees with Constraints
Sort
View
SIGMETRICS
1998
ACM
114views Hardware» more  SIGMETRICS 1998»
14 years 1 months ago
Generating Representative Web Workloads for Network and Server Performance Evaluation
One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on curr...
Paul Barford, Mark Crovella
SBBD
2007
126views Database» more  SBBD 2007»
13 years 10 months ago
Constraint-based Tree Pattern Mining
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 1 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
14 years 16 days ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
COMPSAC
2010
IEEE
13 years 6 months ago
Representing and Reasoning about Web Access Control Policies
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
Gail-Joon Ahn, Hongxin Hu, Joohyung Lee, Yunsong M...