Sciweavers

549 search results - page 76 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
JUCS
2006
107views more  JUCS 2006»
14 years 9 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
NN
2007
Springer
15 years 4 months ago
Impact of Higher-Order Correlations on Coincidence Distributions of Massively Parallel Data
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
Sonja Grün, Moshe Abeles, Markus Diesmann
PODC
2004
ACM
15 years 3 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
CATS
2008
14 years 11 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
SIGGRAPH
1995
ACM
15 years 1 months ago
Multiresolution analysis of arbitrary meshes
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly...
Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hop...