Sciweavers

10890 search results - page 1862 / 2178
» Automatic Complexity Analysis
Sort
View
FOCS
1999
IEEE
15 years 11 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
15 years 11 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
AGENTS
1999
Springer
15 years 11 months ago
On Being a Teammate: Experiences Acquired in the design of RoboCup Teams
Increasingly, multi-agent systems are being designed for a variety of complex, dynamic domains. E ective agent interactions in such domains raise some of most fundamental research...
Stacy Marsella, Jafar Adibi, Yaser Al-Onaizan, Gal...
INFOVIS
1999
IEEE
15 years 11 months ago
Sensemaking of Evolving Web Sites Using Visualization Spreadsheets
In the process of knowledge discovery, workers examine available information in order to make sense of it. By sensemaking, we mean interacting with and operating on the informatio...
Ed Huai-hsin Chi, Stuart K. Card
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 11 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
« Prev « First page 1862 / 2178 Last » Next »