Sciweavers

896 search results - page 44 / 180
» On completeness of word reversing
Sort
View
ICSM
2003
IEEE
15 years 6 months ago
Deriving tolerant grammars from a base-line grammar
A grammar-based approach to tool development in re- and reverse engineering promises precise structure awareness, but it is problematic in two respects. Firstly, it is a considera...
Steven Klusener, Ralf Lämmel
120
Voted
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 2 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
TOCS
2008
107views more  TOCS 2008»
15 years 18 days ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
116
Voted
DAWAK
2009
Springer
14 years 10 months ago
Towards a Modernization Process for Secure Data Warehouses
Data Warehouses (DW) manage crucial enterprise information used for the decision making process which has to be protected from unauthorized accesses. However, security constraints ...
Carlos Blanco, Ricardo Pérez-Castillo, Arnu...
109
Voted
CAD
2008
Springer
15 years 24 days ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin