Sciweavers

13987 search results - page 771 / 2798
» The Two Guards Problem
Sort
View
ALGOSENSORS
2008
Springer
15 years 9 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
ATAL
2008
Springer
15 years 9 months ago
Nonuniform bribery
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
Piotr Faliszewski
COMPGEOM
2005
ACM
15 years 9 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
COMPGEOM
2008
ACM
15 years 9 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
EWCBR
2008
Springer
15 years 9 months ago
Evaluation Measures for TCBR Systems
Textual-case based reasoning (TCBR) systems where the problem and solution are in free text form are hard to evaluate. In the absence of class information, domain experts are neede...
M. A. Raghunandan, Nirmalie Wiratunga, Sutanu Chak...