Sciweavers

357 search results - page 42 / 72
» Algorithms for the coalitional manipulation problem
Sort
View
93
Voted
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
15 years 4 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
15 years 1 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
DASFAA
2008
IEEE
90views Database» more  DASFAA 2008»
15 years 6 months ago
Even an Ant Can Create an XSD
Abstract. The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of its ...
Ondrej Vosta, Irena Mlynkova, Jaroslav Pokorn&yacu...
CHI
1993
ACM
15 years 4 months ago
Synthesizing auditory icons
Auditory icons add valuable functionality to computer interfaces, particularly when they are parameterized to convey dimensional information. They are difficult to create and mani...
William W. Gaver
94
Voted
ICFP
2006
ACM
16 years 11 days ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross