Sciweavers

28888 search results - page 152 / 5778
» Computability and complexity in analysis
Sort
View
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 8 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 9 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
PODC
2006
ACM
14 years 2 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
COMPUTER
2004
54views more  COMPUTER 2004»
13 years 8 months ago
Modeling Complex Spoken Dialog
Hans Dybkjær, Laila Dybkjær
COMPUTING
1998
72views more  COMPUTING 1998»
13 years 7 months ago
Worst-Case Versus Average Case Complexity of Ray-Shooting
László Szirmay-Kalos, Gábor M...