3946 search results - page 763 / 790 » The computational complexity of choice sets |
137
click to vote
PEPM
2010
ACM
16 years 1 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
143
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
148
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
151
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
154
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...