5350 search results - page 271 / 1070 » Space and time in eco-ontologies |
179
click to vote
ACL
2011
14 years 10 months ago
2011
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
186
Voted
ANTS
2004
Springer
16 years 3 days ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
199
click to vote
ACNS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
190
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
203
Voted
KES
2006
Springer
15 years 6 months ago
2006
Springer
This paper investigates cluster formation in decentralized sensor grids and focusses on predicting when the cluster formation converges to a stable configuration. The traffic volum...