Sciweavers

120 search results - page 15 / 24
» Presenting Morphisms of Distributive Laws
Sort
View
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
ESANN
2006
13 years 11 months ago
Cultures of dissociated neurons display a variety of avalanche behaviours
Avalanche dynamics has been described in organotypic cultures and acute slices from rat cortex. Its distinctive feature is a statistical distribution of avalanche size and duration...
Roberta Alessio, Laura Cozzi, Vittorio Sanguineti
COLING
2002
13 years 9 months ago
The Computation of Word Associations: Comparing Syntagmatic and Paradigmatic Approaches
It is shown that basic language processes such as the production of free word associations and the generation of synonyms can be simulated using statistical models that analyze th...
Reinhard Rapp
SC
1994
ACM
14 years 1 months ago
Truly distribution-independent algorithms for the N-body problem
The N - body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compu...
Srinivas Aluru, Gurpur M. Prabhu, John L. Gustafso...
MOBISYS
2003
ACM
14 years 9 months ago
Characterizing Mobility and Network Usage in a Corporate Wireless Local-Area Network
Wireless local-area networks are becoming increasingly popular. They are commonplace on university campuses and inside corporations, and they have started to appear in public area...
Magdalena Balazinska, Paul Castro