Sciweavers

1760 search results - page 302 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
FC
1998
Springer
96views Cryptology» more  FC 1998»
13 years 12 months ago
Compliance Checking in the PolicyMaker Trust Management System
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
Matt Blaze, Joan Feigenbaum, Martin Strauss
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 2 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
DASFAA
2005
IEEE
157views Database» more  DASFAA 2005»
14 years 1 months ago
Adaptively Detecting Aggregation Bursts in Data Streams
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
Aoying Zhou, Shouke Qin, Weining Qian
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...