790 search results - page 96 / 158 » Subexponential Parameterized Algorithms |
158
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
136
click to vote
TACAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
184
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
164
click to vote
BROADNETS
2004
IEEE
15 years 9 months ago
2004
IEEE
Display of continuous media using self-organizing ad hoc networks of wireless communication systems will potentially be used in a variety of applications. Example deployments migh...
142
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...