Sciweavers

217 search results - page 22 / 44
» Backdoors To Typical Case Complexity
Sort
View
ICEBE
2007
IEEE
158views Business» more  ICEBE 2007»
15 years 5 months ago
The Design of A Rule-based and Event-driven Trust Management Framework
In both E-Commerce (EC) and Service-Oriented Computing (SOC) environments, sellers or service providers interact with customers or service clients for services or transactions. Fr...
Yan Wang 0002, Duncan S. Wong, Kwei-Jay Lin, Vijay...
ISPDC
2007
IEEE
15 years 5 months ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky
FOCS
2006
IEEE
15 years 5 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
97
Voted
SAC
2004
ACM
15 years 4 months ago
Statistical properties of transactional databases
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
Paolo Palmerini, Salvatore Orlando, Raffaele Pereg...
PVLDB
2008
116views more  PVLDB 2008»
14 years 10 months ago
Accuracy estimate and optimization techniques for SimRank computation
The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of th...
Dmitry Lizorkin, Pavel Velikhov, Maxim N. Grinev, ...