Sciweavers

450 search results - page 29 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
SIAMDM
2002
94views more  SIAMDM 2002»
14 years 11 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
CSMR
2000
IEEE
15 years 4 months ago
Foundations of Enterprise Software Deployment
While Software Engineering has mainly focused so far on software development, software deployment is now emerging as a new research field. Software or Application deployment is a ...
Thierry Coupaye, Jacky Estublier
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 13 days ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
VISUALIZATION
2003
IEEE
15 years 5 months ago
Interactive View-Dependent Rendering with Conservative Occlusion Culling in Complex Environments
This paper presents a novel algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of ...
Sung-Eui Yoon, Brian Salomon, Dinesh Manocha
CORR
2006
Springer
153views Education» more  CORR 2006»
14 years 12 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...