15033 search results - page 102 / 3007 » Complexity Theory and Algorithms |
129
Voted
HICSS
2008
IEEE
15 years 10 months ago
2008
IEEE
Architecting security solutions for today’s diverse computer systems is a challenge. The modern business environment is comprised of many different applications, e-mail, databas...
135
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
151
Voted
COMPUTING
2008
15 years 3 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
134
Voted
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
132
Voted
TCS
2010
14 years 10 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...