8196 search results - page 201 / 1640 » Computational Modeling and Complexity Science |
184
click to vote
PODC
2006
ACM
16 years 13 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
195
click to vote
COMPLEXITY
2010
15 years 3 months ago
2010
The increasing sophistication of the tools and results of cellular and molecular neuroscience would appear to suggest that explanatory force in neuroscience is defined by reductio...
161
click to vote
ACSC
2009
IEEE
16 years 1 months ago
2009
IEEE
Privacy is today an important concern for both data providers and data users. Data generalization can provide significant protection of an individual’s privacy, which means the...
152
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
157
click to vote
SCCC
1998
IEEE
15 years 10 months ago
1998
IEEE
Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its inte...