Sciweavers

1225 search results - page 161 / 245
» The Instance Complexity Conjecture
Sort
View
CHI
2005
ACM
14 years 9 months ago
Applying the lessons of the attack on the world trade center, 11th September 2001, to the design and use of interactive evacuati
The collapse of buildings, such as terminal 2E at Paris' Charles de Gaule Airport, and of fires, such as the Rhode Island, Station Night Club tragedy, has focused public atte...
C. W. Johnson
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 9 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 9 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
VLDB
2001
ACM
151views Database» more  VLDB 2001»
14 years 9 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 9 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li