Sciweavers

5592 search results - page 82 / 1119
» On Random Betweenness Constraints
Sort
View
TCS
1998
13 years 9 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
DAM
2008
116views more  DAM 2008»
13 years 10 months ago
Expected number of breakpoints after t random reversals in genomes with duplicate genes
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
Niklas Eriksen
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 10 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
INFOCOM
2006
IEEE
14 years 4 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
CASES
2006
ACM
14 years 4 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick