2233 search results - page 193 / 447 » On the Complexity of Theory Curbing |
151
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
158
click to vote
HICSS
2006
IEEE
16 years 16 days ago
2006
IEEE
Previous studies indicate that the expected effects of e-Government are slower to realize than initially expected. Several authors argue that e-Government involves particularly co...
163
click to vote
ICNP
2006
IEEE
16 years 16 days ago
2006
IEEE
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
131
click to vote
KBSE
2005
IEEE
16 years 2 days ago
2005
IEEE
We propose an approach for complex software analysis based on visualization. Our work is motivated by the fact that in spite of years of research and practice, software developmen...
189
click to vote
MM
2004
ACM
15 years 12 months ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...