Sciweavers

672 search results - page 36 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
14 years 1 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
FIW
2009
120views Communications» more  FIW 2009»
13 years 5 months ago
Software Security Vulnerabilities Seen As Feature Interactions
The security of software applications is an important domain, and one that mixes formalisms (e.g. when dealing with cryptography and security protocols) with very ad hoc, low level...
Guy-Vincent Jourdan
AVI
2008
13 years 10 months ago
Visual design of service deployment in complex physical environments
In this paper we discuss the problem of deploying appliances for interactive services in complex physical environments using a knowledge based approach to define the relations bet...
Augusto Celentano, Fabio Pittarello