147 search results - page 28 / 30 » The Number of Independent Sets in a Graph with Small Maximum... |
COMPGEOM
2005
ACM
13 years 8 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
BMCBI
2008
13 years 6 months ago
2008
Background: In microarray experiments the numbers of replicates are often limited due to factors such as cost, availability of sample or poor hybridization. There are currently fe...
PODC
2004
ACM
13 years 11 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
EPIA
2007
Springer
14 years 11 days ago
2007
Springer
This paper describes a complete and efficient vision system developed for the robotic soccer team of the University of Aveiro, CAMBADA (Cooperative Autonomous Mobile roBots with A...