2252 search results - page 348 / 451 » Lower Bounds for Dynamic Algorithms |
100
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
113
Voted
COLT
2008
Springer
15 years 4 months ago
2008
Springer
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
160
click to vote
GRAPHICSINTERFACE
2007
15 years 4 months ago
2007
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
123
Voted
SIROCCO
2004
15 years 4 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
132
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...