Sciweavers

36 search results - page 3 / 8
» A Linear Delay Algorithm for Building Concept Lattices
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 10 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
76
Voted
DAC
2010
ACM
15 years 3 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel
TON
2008
69views more  TON 2008»
14 years 11 months ago
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...
Michael J. Neely
ICFCA
2004
Springer
15 years 5 months ago
FCA in Knowledge Technologies: Experiences and Opportunities
Abstract. Managing knowledge is a difficult and slippery enterprise. A wide variety of technologies have to be invoked in providing support for knowledge requirements, ranging fro...
Yannis Kalfoglou, Srinandan Dasmahapatra, Yun-Heh ...
115
Voted
LATIN
2010
Springer
15 years 6 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...