Sciweavers

1813 search results - page 176 / 363
» Calculi of Approximation Spaces
Sort
View
EMNLP
2006
15 years 7 months ago
Random Indexing using Statistical Weight Functions
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
James Gorman, James R. Curran
CCCG
2001
15 years 7 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
15 years 6 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
CJ
2010
128views more  CJ 2010»
15 years 6 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 6 months ago
On some deterministic dictionaries supporting sparsity
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen