Sciweavers

3894 search results - page 552 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
PODS
2000
ACM
112views Database» more  PODS 2000»
15 years 8 months ago
Auditing Boolean Attributes
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
Jon M. Kleinberg, Christos H. Papadimitriou, Prabh...
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
15 years 8 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
137
Voted
DCOSS
2008
Springer
15 years 5 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
NETWORKING
2007
15 years 5 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 5 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro