Sciweavers

3946 search results - page 707 / 790
» The computational complexity of choice sets
Sort
View
ECCC
2010
87views more  ECCC 2010»
15 years 3 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
INFOCOM
2011
IEEE
14 years 9 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
NAR
2011
214views Computer Vision» more  NAR 2011»
14 years 9 months ago
DAnCER: Disease-Annotated Chromatin Epigenetics Resource
Chromatin modification (CM) is a set of epigenetic processes that govern many aspects of DNA replication, transcription and repair. CM is carried out by groups of physically inter...
Andrei L. Turinsky, Brian Turner, Rosanne C. Borja...
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 8 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
SIGIR
2012
ACM
13 years 8 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li