SAC 2008 - PDF Preprint Papers

SAC 2008 Symposium on Applied Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SAC-2008 Paper

click to vote

SAC
2008
ACM

453views Applied Computing» more SAC 2008»

IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution

13 years 4 months ago

Download www.cs.clemson.edu

There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a defic...

Joel E. Denny, Brian A. Malloy

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	453	IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution	claim
2	263	Computational methods for complex stochastic systems: a review of some alternatives to MCMC	claim
3	208	XEdge: clustering homogeneous and heterogeneous XML documents using edge summaries	claim
4	203	Embedding SPARQL into XQuery/XSLT	claim
5	202	Increasing trust through the use of 3d e-commerce environment	claim
6	202	On the computation of the noncentral F and noncentral beta distribution	claim
7	188	Local linear regression with adaptive orthogonal fitting for the wind power application	claim
8	182	A clustering-based approach for discovering interesting places in trajectories	claim
9	179	Aggregation languages for moving object and places of interest	claim
10	176	Pattern ranking for semi-automatic ontology construction	claim
11	176	Bayesian inference for a discretely observed stochastic kinetic model	claim
12	174	Author identification using writer-dependent and writer-independent strategies	claim
13	171	Runtime concepts for the C++ standard template library	claim
14	170	Error estimation in wireless sensor networks	claim
15	168	A hybrid software-based self-testing methodology for embedded processor	claim
16	165	Adding background knowledge to formal concept analysis via attribute dependency formulas	claim
17	165	Implementing Java modeling language contracts with AspectJ	claim
18	165	An objective way to evaluate and compare binarization algorithms	claim
19	164	Towards a model-driven engineering approach for developing embedded hard real-time software	claim
20	164	Design pattern detection by template matching	claim
21	162	Spatial vagueness and imprecision in databases	claim
22	160	Using simplified event calculus in digital investigation	claim
23	160	A cost-driven approach to role engineering	claim
24	158	Tag-aware recommender systems by fusion of collaborative filtering algorithms	claim
25	158	The QoS-MO ontology for semantic QoS modeling	claim
26	158	Efficient concept clustering for ontology learning using an event life cycle on the web	claim
27	155	Model-driven development of component-based adaptive distributed applications	claim
28	155	Crime scene classification	claim
29	155	Adaptive methods for sequential importance sampling with application to state space models	claim
30	154	Adaptive independence samplers	claim
31	153	Frequent pattern mining for kernel trace data	claim
32	153	Adaptive importance sampling in general mixture classes	claim
33	149	Decision-making coordination in collaborative product configuration	claim
34	149	Continuous k-dominant skyline computation on multidimensional data streams	claim
35	149	Designing semantic web services using conceptual model	claim
36	147	Removing useless variables in cost analysis of Java bytecode	claim
37	147	Enhancing web service selection by QoS-based ontology and WS-policy	claim
38	146	Discovering relationships among categories using misclassification information	claim
39	146	PPEPR: plug and play electronic patient records	claim
40	145	Flexible pointer analysis using assign-fetch graphs	claim
41	140	Contextualizing normative open multi-agent systems	claim
42	140	An efficient feature ranking measure for text categorization	claim
43	137	Secure deletion for NAND flash file system	claim
44	137	A software architecture for ontology-driven situation awareness	claim
45	137	Data sharing vs. message passing: synergy or incompatibility?: an implementation-driven case study	claim
46	136	A framework for performance evaluation and functional verification in stochastic process algebras	claim
47	136	Learning to identify emotions in text	claim
48	136	Strangeness-based feature weighting and classification of gene expression profiles	claim
49	135	Fast self-healing gradients	claim
50	135	Toward quality requirements analysis based on domain specific quality spectrum	claim
51	135	Exploring social annotations for web document classification	claim
52	135	ICER: a tool for finding errors in a UML model	claim
53	133	Middleware of Taiwan UniGrid	claim
54	133	Towards automatic feature vector optimization for multimedia applications	claim
55	133	Supporting the development of context-aware agent-based systems for mobile networks	claim
56	130	Collaborative software engineering on large-scale models: requirements and experience in ModelBus	claim
57	129	Trajectory retrieval with latent semantic analysis	claim
58	129	Decentralized coordination strategies for the vehicle routing problem	claim
59	129	Autonomic trust reasoning enables misbehavior detection in OLSR	claim
60	129	Autonomic management policy specification in Tune	claim
61	128	PHALANX: a graph-theoretic framework for test case prioritization	claim
62	128	Preserving coordination properties when transforming concurrent system components	claim
63	128	Adaptive evolutionary Monte Carlo algorithm for optimization with applications to sensor placement problems	claim
64	126	UML-based design test generation	claim
65	126	Particle methods for maximum likelihood estimation in latent variable models	claim
66	126	Profile based comparative analysis for AOSE methodologies evaluation	claim
67	125	Selectivity estimation in spatial networks	claim
68	125	Checking the alignment of value-based business models and IT functionality	claim
69	124	Digital audio watermarking evaluation within the application field of perceptual hashing	claim
70	124	The volume in focus: hardware-assisted focus and context effects for volume visualization	claim
71	124	A generic XML language for characterising objects to support digital preservation	claim
72	123	On delegation and workflow execution models	claim
73	123	Optimizing code through iterative specialization	claim
74	123	Computing H/D-exchange speeds of single residues from data of peptic fragments	claim
75	123	XBird/D: distributed and parallel XQuery processing using remote proxy	claim
76	121	Automated classification of change messages in open source projects	claim
77	121	Providing dependability for web services	claim
78	120	A lifecycle approach to SOA governance	claim
79	120	Automatic software fault localization using generic program invariants	claim
80	119	Supporting self-organization for hybrid grid resource scheduling	claim
81	119	Towards design patterns for ontology alignment	claim
82	118	Towards a complete SCM ontology: the case of ontologising RosettaNet	claim
83	118	Sensor stream reduction for clustered wireless sensor networks	claim
84	118	Filtering drowsy instruction cache to achieve better efficiency	claim
85	117	Expected energy consumption minimization in DVS systems with discrete frequencies	claim
86	117	A biologically inspired generation of virtual characters	claim
87	116	Hermes: a semantic web-based news decision support system	claim
88	116	Anomaly detection algorithms in logs of process aware systems	claim
89	116	Privacy-preserving link discovery	claim
90	116	A service architecture for sensor data provisioning for context-aware mobile applications	claim
91	115	ECG data provisioning for telehomecare monitoring	claim
92	115	Symbiosis in logic-based pointcuts over a history of join points	claim
93	114	Dynamic support to transactional remote invocations over multiple transports	claim
94	114	A mixture model for random graphs	claim
95	113	Exploiting program cyclic behavior to reduce memory latency in embedded processors	claim
96	113	ML estimation for factor analysis: EM or non-EM?	claim
97	112	Improving denial of service resistance using dynamic local adaptations	claim
98	112	Template design and automatic generation of controllers for industrial robots	claim
99	111	Universal concurrent constraint programing: symbolic semantics and applications to security	claim
100	111	A self-balancing striping scheme for NAND-flash storage systems	claim
101	111	A constraint hierarchies approach to geometric constraints on sketches	claim
102	111	Extending omniscient debugging to support aspect-oriented programming	claim
103	110	Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access	claim
104	109	Test generation and minimization with "basic" statecharts	claim
105	109	Proposing metrics of difficulty of domain knowledge using usecase diagrams	claim
106	108	Code-carrying theory	claim
107	108	Towards self-configuration and management of e-service provisioning in dynamic value constellations	claim
108	108	Serpentine: adaptive middleware for complex heterogeneous distributed systems	claim
109	108	Optimized dynamic semantic composition of services	claim
110	107	Dynamic populations in genetic algorithms	claim
111	107	Power-efficient and scalable load/store queue design via address compression	claim
112	107	Large-scale simulation of V2V environments	claim
113	106	Reachability analysis of generalized polygonal hybrid systems	claim
114	106	Modelling adaptive services for distributed systems	claim
115	106	Conflict-aware load-balancing techniques for database replication	claim
116	105	Web service security management using semantic web techniques	claim
117	105	Slack time evaluation with RTSJ	claim
118	103	Workflow management versus case handling: results from a controlled software experiment	claim
119	103	Mining fault-tolerant frequent patterns efficiently with powerful pruning	claim
120	103	Knowledge-based semantic clustering	claim
121	103	Web service access management for integration with agent systems	claim
122	102	Offline count-limited certificates	claim
123	102	Metropolis-Hastings algorithms with adaptive proposals	claim
124	101	Splitting heuristics for disjunctive numerical constraints	claim
125	100	Using the RRT algorithm to optimize classification systems for handwritten digits and letters	claim
126	100	Total order broadcast on pervasive systems	claim
127	99	SIPRe: a partial database replication protocol with SI replicas	claim
128	99	SPEM on test: the SODA case study	claim
129	99	An integrated web system to facilitate personalized web searching algorithms	claim
130	97	SiZer Map for inference with additive models	claim
131	96	An approach to mobile collaborative mapping	claim
132	96	Publish/subscribe architecture for mobile ad hoc networks	claim
133	95	A remote display system for Java-based mobile applications	claim
134	94	A framework for dependable QoS adaptation in probabilistic environments	claim
135	90	Making colors worth more than a thousand words	claim
136	89	Whom should I trust?: the impact of key figures on cold start recommendations	claim
137	88	Configuring features with stakeholder goals	claim
138	88	Context distribution for supporting composition of applications in ubiquitous computing	claim
139	88	A reusable object-oriented design to support self-testable autonomic software	claim
140	88	Output-sensitive algorithms for Tukey depth and related problems	claim
141	87	A pull-based e-mail architecture	claim
142	87	The tale of the weather worm	claim
143	84	Formal definition of measures for UML statechart diagrams using OCL	claim
144	83	Pentagons: a weakly relational abstract domain for the efficient validation of array accesses	claim
145	82	Securing aspect composition	claim
146	81	Extending peer-to-peer networks for approximate search	claim
147	81	Evaluation of Tweedie exponential dispersion model densities by Fourier inversion	claim
148	80	Curve prediction and clustering with mixtures of Gaussian process functional regression models	claim
149	79	Using adaptive distinguishing sequences in checking sequence constructions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers