2168 search results - page 376 / 434 » Randomized Algorithms and Complexity Theory |
133
click to vote
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
132
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
151
Voted
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social netw...
114
click to vote
DAC
2007
ACM
16 years 3 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
130
click to vote
CCECE
2009
IEEE
15 years 9 months ago
2009
IEEE
The inverse diffusion problems deal with the estimation of many crucial parameters such as the diffusion coefficient, source properties, and boundary conditions. Such algorithms ...