Sciweavers

9842 search results - page 1280 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
189
Voted
SIGMOD
2004
ACM
112views Database» more  SIGMOD 2004»
16 years 7 months ago
Matching Large XML Schemas
Current schema matching approaches still have to improve for very large and complex schemas. Such schemas are increasingly written in the standard language W3C XML schema, especia...
Erhard Rahm, Hong Hai Do, Sabine Massmann
DCC
2008
IEEE
16 years 7 months ago
An Estimation-Theoretic Interpretation of Video Rate Distortion Optimization with Lagrangian Formulation
Rate distortion optimization with Lagrangian formulation is widely used in video encoder control and has proved effective in achieving a good trade-off between coding efficiency a...
Zhen Li, Alexis Michael Tourapis
SAC
2010
ACM
16 years 2 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato
AGILEDC
2009
IEEE
16 years 2 months ago
From Anarchy to Sustainable Development: Scrum in Less than Ideal Conditions
In early 2008, Pyxis Technologies was contracted in the third of a series of projects distributed between Canada and France. This project dwarfed its predecessors in scope and com...
Isabelle Therrien, Erik LeBel
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
16 years 2 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali
« Prev « First page 1280 / 1969 Last » Next »