Sciweavers

7066 search results - page 1122 / 1414
» Contact Relations with Applications
Sort
View
ECCC
2010
95views more  ECCC 2010»
15 years 7 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
EOR
2010
92views more  EOR 2010»
15 years 7 months ago
A survey of variants and extensions of the resource-constrained project scheduling problem
The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is ...
Sönke Hartmann, Dirk Briskorn
DSS
2008
121views more  DSS 2008»
15 years 7 months ago
SpidersRUs: Creating specialized search engines in multiple languages
While small-scale search engines in specific domains and languages are increasingly used by Web users, most existing search engine development tools do not support the development...
Michael Chau, Jialun Qin, Yilu Zhou, Chunju Tseng,...
ECCC
2008
98views more  ECCC 2008»
15 years 7 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
15 years 7 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
« Prev « First page 1122 / 1414 Last » Next »