11211 search results - page 2086 / 2243 » Rank-Sensitive Data Structures |
92
Voted
ENTCS
2007
15 years 1 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
125
Voted
JSAC
2006
15 years 1 months ago
2006
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
137
Voted
JSS
2006
15 years 1 months ago
2006
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
91
Voted
MP
2008
15 years 1 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
111
Voted
JVCA
2006
15 years 1 months ago
2006
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...