Sciweavers

849 search results - page 52 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
UC
2009
Springer
14 years 2 months ago
Resource-Competing Oscillator Network as a Model of Amoeba-Based Neurocomputer
Abstract. An amoeboid organism, Physarum, exhibits rich spatiotemporal oscillatory behavior and various computational capabilities. Previously, the authors created a recurrent neur...
Masashi Aono, Yoshito Hirata, Masahiko Hara, Kazuy...
LCPC
1997
Springer
13 years 12 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
PODS
2002
ACM
98views Database» more  PODS 2002»
14 years 8 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
SIGECOM
2003
ACM
119views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Preference elicitation in proxied multiattribute auctions
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
Aditya V. Sunderam, David C. Parkes
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
13 years 9 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer