Sciweavers

266 search results - page 16 / 54
» General Homomorphic Overloading
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 5 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa
SSDBM
2007
IEEE
124views Database» more  SSDBM 2007»
14 years 2 months ago
Incorporating Uncertainty Metrics into a General-Purpose Data Integration System
There is a significant need for data integration capabilities in the scientific domain, which has manifested itself as products in the commercial world as well as academia. Howeve...
Brenton Louie, Landon Detwiler, Nilesh N. Dalvi, R...
RTSS
2005
IEEE
14 years 2 months ago
Generalized Performance Management of Multi-Class Real-Time Imprecise Data Services
The intricacy of real-time data service management increases mainly due to the emergence of applications operating in open and unpredictable environments, increases in software co...
Mehdi Amirijoo, Nicolas Chaufette, Jörgen Han...
CCS
2008
ACM
13 years 10 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki