38 search results - page 2 / 8 » Orbit-stabilizer Problems and Computing Normalizers for Poly... |
PAMI
2010
13 years 4 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
ISBI
2011
IEEE
12 years 10 months ago
2011
IEEE
This paper presents an algorithm to classify pixels in uterine cervix images into two classes, namely normal and abnormal tissues, and simultaneously select relevant features, usi...
FOCS
1992
IEEE
13 years 10 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
DAM
2008
13 years 6 months ago
2008
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
ICASSP
2007
IEEE
14 years 18 days ago
2007
IEEE
The goal of computational auditory scene analysis (CASA) is to create computer systems that can take as input a mixture of sounds and form packages of acoustic evidence such that ...