Sciweavers

1322 search results - page 221 / 265
» Parameterized counting problems
Sort
View
AAAI
2007
14 years 9 days ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer
DMCS
2003
13 years 11 months ago
A Reciprocity Theorem for Monomer-Dimer Coverings
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...
Nick Anzalone, John Baldwin, Ilya Bronshtein, T. K...
NIPS
2004
13 years 11 months ago
Detecting Significant Multidimensional Spatial Clusters
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
Daniel B. Neill, Andrew W. Moore, Francisco Pereir...
IKE
2003
13 years 11 months ago
A Statistics-Based Approach to Incrementally Update Inverted Files
Many information retrieval systems use the inverted file as indexing structure. The inverted file, however, is not suited to supporting incremental updates when new documents are ...
Wann-Yun Shieh, Chung-Ping Chung
SIROCCO
2000
13 years 11 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman