Sciweavers

1136 search results - page 198 / 228
» Finding Small Holes
Sort
View
SIGIR
2003
ACM
14 years 1 months ago
Salton Award Lecture - Information retrieval and computer science: an evolving relationship
Following the tradition of these acceptance talks, I will be giving my thoughts on where our field is going. Any discussion of the future of information retrieval (IR) research, h...
W. Bruce Croft
ICRA
2002
IEEE
96views Robotics» more  ICRA 2002»
14 years 1 months ago
Mobility Enhancements to the Scout Robot Platform
When a distributed robotic system is assigned to perform reconnaissance or surveillance, restrictions inherent to the design of an individual robot limit the system’s performanc...
Andrew Drenner, Ian T. Burt, Tom Dahlin, Bradley K...
SAC
2009
ACM
14 years 1 months ago
Spam decisions on gray e-mail using personalized ontologies
E-mail is one of the most common communication methods among people on the Internet. However, the increase of e-mail misuse/abuse has resulted in an increasing volume of spam e-ma...
Seongwook Youn, Dennis McLeod
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 1 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
FOCS
1999
IEEE
14 years 29 days ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan