Sciweavers

1996 search results - page 350 / 400
» Financial Theory 2
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 9 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
15 years 8 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
SOSP
2005
ACM
15 years 8 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
PLPV
2009
ACM
15 years 8 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
CSCW
2010
ACM
15 years 8 months ago
Socialization tactics in wikipedia and their effects
Socialization of newcomers is critical both for conventional groups. It helps groups perform effectively and the newcomers develop commitment. However, little empirical research h...
Boreum Choi, Kira Alexander, Robert E. Kraut, John...