Result 1 to 20 of 5289 total
On multiple-instance learning of halfspaces. (English)
Inf. Process. Lett. 112, No. 23, 933-936 (2012).
1
Parity games on undirected graphs. (English)
Inf. Process. Lett. 112, No. 23, 928-932 (2012).
2
Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm. (English)
Inf. Process. Lett. 112, No. 23, 922-927 (2012).
3
Information measures based on fractional calculus. (English)
Inf. Process. Lett. 112, No. 23, 916-921 (2012).
4
An improved analysis of SRPT scheduling algorithm on the basis of functional optimization. (English)
Inf. Process. Lett. 112, No. 23, 911-915 (2012).
5
An improved approximation algorithm for the clustered traveling salesman problem. (English)
Inf. Process. Lett. 112, No. 23, 908-910 (2012).
6
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities. (English)
Inf. Process. Lett. 112, No. 23, 903-907 (2012).
7
$H$-colorings of dense hypergraphs. (English)
Inf. Process. Lett. 112, No. 23, 899-902 (2012).
8
A simple reduction from maximum weight matching to maximum cardinality matching. (English)
Inf. Process. Lett. 112, No. 23, 893-898 (2012).
9
Constrained multilinear detection for faster functional motif discovery. (English)
Inf. Process. Lett. 112, No. 22, 889-892 (2012).
10
An efficient IND-CCA2 secure Paillier-based cryptosystem. (English)
Inf. Process. Lett. 112, No. 22, 885-888 (2012).
11
A result on linear coloring of planar graphs. (English)
Inf. Process. Lett. 112, No. 22, 880-884 (2012).
12
A note on asynchronous multi-exponentiation algorithm using binary representation. (English)
Inf. Process. Lett. 112, No. 22, 876-879 (2012).
13
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers. (English)
Inf. Process. Lett. 112, No. 22, 872-875 (2012).
14
A note on the algebraic immunity of the Maiorana-McFarland class of bent functions. (English)
Inf. Process. Lett. 112, No. 22, 869-871 (2012).
15
Enhancing customer relationships by semantic consumer support systems. (English)
Inf. Process. Lett. 112, No. 22, 860-868 (2012).
16
Verifiable secret sharing in a total of three rounds. (English)
Inf. Process. Lett. 112, No. 22, 856-859 (2012).
17
Membership(s) and compliance(s) with class-based graphs. (English)
Inf. Process. Lett. 112, No. 22, 849-855 (2012).
18
Antimagic labeling graphs with a regular dominating subgraph. (English)
Inf. Process. Lett. 112, No. 21, 844-847 (2012).
19
On the 1-fault Hamiltonicity for graphs satisfying Ore’s theorem. (English)
Inf. Process. Lett. 112, No. 21, 839-843 (2012).
20
Result 1 to 20 of 5289 total
Start
Contact
Print
General Help
