33 search results - page 4 / 7 » Simple deterministic wildcard matching |
110
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
203
click to vote
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
126
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
112
Voted
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper presents a scheme for testing DACs’ static non-linearity errors by using a two-step flash ADC with deterministic dynamic element matching (DDEM). In this work, the...
124
Voted
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...