Sciweavers

7840 search results - page 351 / 1568
» On generalized Ramsey numbers
Sort
View
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 10 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
CIKM
2008
Springer
15 years 8 months ago
SQL extension for exploring multiple tables
The standard SQL assumes that the users are aware of all tables and their schemas to write queries. This assumption may be valid when the users deal with a relatively small number...
Sung Jin Kim, Junghoo John Cho
EJC
2008
15 years 7 months ago
Fractional coloring and the odd Hadwiger's conjecture
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
Ken-ichi Kawarabayashi, Bruce A. Reed
207
Voted
COMGEO
2007
ACM
15 years 6 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
IJFCS
2006
58views more  IJFCS 2006»
15 years 6 months ago
Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis
Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the ...
Yuli Ye, Janusz A. Brzozowski