Sciweavers

2827 search results - page 55 / 566
» Robustness of PSPACE-complete sets
Sort
View
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
ICRA
2002
IEEE
183views Robotics» more  ICRA 2002»
14 years 20 days ago
Mobile Robot Localization Based on Random Closed Set Model Maps
In this paper we present a novel approach to mobile robot navigation in natural unstructured environments. Natural scenes can be considered as random fields where a large number ...
Stefan Rolfes, Maria-João Rendas
STOC
2000
ACM
55views Algorithms» more  STOC 2000»
14 years 2 days ago
Self-testing of universal and fault-tolerant sets of quantum gates
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
Wim van Dam, Frédéric Magniez, Miche...
HIPEAC
2010
Springer
13 years 9 months ago
Virtual Ways: Efficient Coherence for Architecturally Visible Storage in Automatic Instruction Set Extensions
Abstract. Customizable processors augmented with application-specific Instruction Set Extensions (ISEs) have begun to gain traction in recent years. The most effective ISEs include...
Theo Kluter, Samuel Burri, Philip Brisk, Edoardo C...
LREC
2008
133views Education» more  LREC 2008»
13 years 9 months ago
Comparing Set-Covering Strategies for Optimal Corpus Design
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
Jonathan Chevelu, Nelly Barbot, Olivier Boëff...