Sciweavers

11381 search results - page 131 / 2277
» Connectivity
Sort
View
159
Voted
PEPM
2012
ACM
13 years 11 months ago
Ideas for connecting inductive program synthesis and bidirectionalization
We share a vision of connecting the topics of bidirectional transformation and inductive program synthesis, by proposing to use the latter in approaching problematic aspects of th...
Janis Voigtländer
ICDE
1998
IEEE
83views Database» more  ICDE 1998»
16 years 5 months ago
Grouping Techniques for Update Propagation in Intermittently Connected Databases
We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server fo...
Sameer Mahajan, Michael J. Donahoo, Shamkant B. Na...
125
Voted
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 4 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
160
Voted
ALGOSENSORS
2009
Springer
15 years 10 months ago
A Note on Uniform Power Connectivity in the SINR Model
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...
137
Voted
IWPEC
2009
Springer
15 years 10 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...