Sciweavers

720 search results - page 138 / 144
» Nonrepetitive colorings of graphs
Sort
View
IVC
2000
179views more  IVC 2000»
13 years 7 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 7 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
13 years 7 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko
PRL
2007
146views more  PRL 2007»
13 years 7 months ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...
COMCOM
2008
99views more  COMCOM 2008»
13 years 6 months ago
Reliability improvement for an RFID-based psychiatric patient localization system
Collaboration between Field Generators, Readers and Tags generates the required functions in using radio frequency identification (RFID) for psychiatric patient localization. The ...
Chieh-Ling Huang, Pau-Choo Chung, Ming-Hua Tsai, Y...