Sciweavers

1743 search results - page 142 / 349
» Generalized Modal Satisfiability
Sort
View
INFOCOM
2008
IEEE
16 years 23 days ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
16 years 16 days ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
SPIRE
2005
Springer
15 years 12 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
W4A
2004
ACM
15 years 11 months ago
The user experience: designs and adaptations
Specifications for accessibility of Web page do not necessarily guarantee a usable or satisfying Web experience for persons with disabilities. The needs of many of these individua...
Vicki L. Hanson
WPES
2004
ACM
15 years 11 months ago
Hidden access control policies with hidden credentials
In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather tha...
Keith B. Frikken, Mikhail J. Atallah, Jiangtao Li