2877 search results - page 136 / 576 » The Complexity of Planarity Testing |
133
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
135
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
120
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Grids have the potential to revolutionize computing by providing ubiquitous, on demand access to computational services and resources. However, grid systems are extremely large, c...
134
click to vote
DSVIS
2005
Springer
15 years 9 months ago
2005
Springer
Multimodal interactive systems offer a flexibility of interaction that increases their complexity. ICARE is a component-based approach to specify and develop multimodal interfaces...
168
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....