Sciweavers

256 search results - page 50 / 52
» Short trees in polygons
Sort
View
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 29 days ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
ICALP
1998
Springer
14 years 24 days ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
FC
2008
Springer
90views Cryptology» more  FC 2008»
13 years 10 months ago
Practical Anonymous Divisible E-Cash from Bounded Accumulators
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
Man Ho Au, Willy Susilo, Yi Mu
ICMLA
2008
13 years 10 months ago
Automated Analysis for Detecting Beams in Laser Wakefield Simulations
Laser wakefield particle accelerators have shown the potential to generate electric fields thousands of times higher than those of conventional accelerators. The resulting extreme...
Daniela Mayumi Ushizima, Oliver Rübel, Prabha...
LBM
2007
13 years 10 months ago
Syntactic Features for Protein-Protein Interaction Extraction
Background: Extracting Protein-Protein Interactions (PPI) from research papers is a way of translating information from English to the language used by the databases that store th...
Rune Sætre, Kenji Sagae, Jun-ichi Tsujii