Sciweavers

876 search results - page 64 / 176
» New Results for the Martin Polynomial
Sort
View
LATIN
2010
Springer
14 years 11 days ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
COMPGEOM
2000
ACM
14 years 11 days ago
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
Olivier Devillers, Alexandra Fronville, Bernard Mo...
APWEB
2008
Springer
13 years 10 months ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
Xiaoxun Sun, Hua Wang, Jiuyong Li
PRL
2008
118views more  PRL 2008»
13 years 8 months ago
A large margin approach for writer independent online handwriting classification
This paper proposes a new approach for classifying multivariate time-series with applications to the problem of writer independent online handwritten character recognition. Each t...
Karthik Kumara, Rahul Agrawal, Chiranjib Bhattacha...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel