Sciweavers

253 search results - page 17 / 51
» Conditional Symmetry Breaking
Sort
View
HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
15 years 2 months ago
"Yeah, the Rush ain't here yet - Take a break": Creation and Use of an Artifact as Organizational Memory
In order to understand organizational memory, it is important to understand how things become adopted as memory resources in organizations. In this paper, we describe the genesis ...
Christine Halverson, Mark S. Ackerman
63
Voted
ASPDAC
2009
ACM
130views Hardware» more  ASPDAC 2009»
15 years 4 months ago
Analog placement with common centroid and 1-D symmetry constraints
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
Linfu Xiao, Evangeline F. Y. Young
CORR
2011
Springer
147views Education» more  CORR 2011»
14 years 4 months ago
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
Marius Zimand
AMAI
2005
Springer
14 years 9 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
PODC
2011
ACM
14 years 14 days ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer