Sciweavers

17760 search results - page 136 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
DCG
2008
118views more  DCG 2008»
15 years 4 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
137
Voted
TASE
2008
IEEE
15 years 3 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi
TKDE
2008
218views more  TKDE 2008»
15 years 3 months ago
A General Model for Sequential Pattern Mining with a Progressive Database
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
Jen-Wei Huang, Chi-Yao Tseng, Jian Chih Ou, Ming-S...
130
Voted
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 8 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
132
Voted
CCS
2008
ACM
15 years 6 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