Sciweavers

932 search results - page 131 / 187
» Where in the Wikipedia Is That Answer
Sort
View
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
13 years 11 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
ASIACRYPT
2006
Springer
13 years 11 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
ECRTS
2004
IEEE
13 years 11 months ago
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
Rodolfo Pellizzoni, Giuseppe Lipari
EDOC
2004
IEEE
13 years 11 months ago
Towards an MDA-Oriented UML Profile for Distribution
The era of distributed systems is upon us. Middlewarespecific concerns, and especially the distribution concern, which is the core of any middleware-mediated application, are addr...
Raul Silaghi, Frédéric Fondement, Al...
FOCS
2004
IEEE
13 years 11 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau