8196 search results - page 445 / 1640 » Computational Modeling and Complexity Science |
168
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
189
click to vote
ACSE
1997
ACM
15 years 11 months ago
1997
ACM
Literate programming is a powerful technique that helps expert programmers integrate code and documentation in a manner that assists human comprehension. To date, tools for litera...
192
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a 1-parameter family...
141
click to vote
GI
2009
Springer
15 years 10 months ago
2009
Springer
Abstract: Voter privacy and verifiability are fundamental security concepts for electronic voting. Existing literature on electronic voting provides many definitions and interpreta...
189
click to vote
DIS
2006
Springer
15 years 10 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...