1322 search results - page 215 / 265 » Parameterized counting problems |
SOFSEM
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
SOFSEM
2007
Springer
14 years 4 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
VLDB
2007
ACM
14 years 4 months ago
2007
ACM
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased ro...
ISQED
2006
IEEE
14 years 4 months ago
2006
IEEE
As transistor counts keep increasing and clock frequencies rise, high power consumption is becoming one of the most important obstacles, preventing further scaling and performance...