Sciweavers

15254 search results - page 28 / 3051
» A k
Sort
View
IEEEARES
2008
IEEE
14 years 4 months ago
A Critique of k-Anonymity and Some of Its Enhancements
k-Anonymity is a privacy property requiring that all combinations of key attributes in a database be repeated at least for k records. It has been shown that k-anonymity alone does...
Josep Domingo-Ferrer, Vicenç Torra
ACSC
2005
IEEE
14 years 3 months ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Mihalis Beis, William Duckworth, Michele Zito
ECML
2005
Springer
14 years 3 months ago
Learning (k, l)-Contextual Tree Languages for Information Extraction
This paper introduces a novel method for learning a wrapper for extraction of information from web pages, based upon (k,l)-contextual tree languages. It also introduces a method to...
Stefan Raeymaekers, Maurice Bruynooghe, Jan Van de...
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
14 years 3 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
STACS
1999
Springer
14 years 2 months ago
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
Mario Szegedy